Search found 1 match

by Battery
Tue Jul 29, 2003 11:52 am
Forum: Volume 103 (10300-10399)
Topic: 10304 - Optimal Binary Search Tree
Replies: 24
Views: 16960

10304 OBST TIME LIMIT

[c]#include <stdio.h>
#define MAXN 250 + 1
int n, solution;
int board[MAXN];
int sum[MAXN][MAXN];
int dynamic[MAXN][MAXN];
void in();
void sol();
void out();
void main()
{
while (scanf("%d",&n)!=EOF)
{
in();
sol();
out();
}
}

void in()
{
int i;
for (i=1;i<=n;i++) scanf("%d",&board ...

Go to advanced search