rcc-legacy/tests/sysy_lvX/069_multiplication_puzzle.sy


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

int a[6]={10,1,50,50,20,5};
int dp[10][10];
int main()
{
	int n;
	n=6;

	int k,i,t,j,aa;
	k=3;
	while(k<=n)
	{
		i=0;
		while(i<n-k+1)
		{
			j=i+k-1;
			t=i+1;
			while(t<j)
			{
				aa= dp[i][t]+dp[t][j]+a[i]*a[t]*a[j];
				if(!dp[i][j]||aa<dp[i][j])
				{
					dp[i][j]=aa;
				}
				t=t+1;
			}
			i=i+1;
		}
		k=k+1;
	}
	putint(dp[0][n-1]);
	return 0;
}