Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register
欢迎参加IJCAI 2020麻将智能体竞赛,大奖等你拿!Welcome to IJCAI 2020 Mahjong AI competition with amazing prizes! | 北京大学《ACM/ICPC大学生程序设计竞赛训练》暑期课面向全球招生!

怎末总超时

Posted by songhaiyang at 2010-01-31 14:34:42 on Problem 1651
#include<stdio.h>
int c[200],n;
void main()
{
	int dp(int a,int b);
	int i;
	scanf("%d",&n);
	for(i=0;i<n;i++)
		scanf("%d",&c[i]);
	printf("%d\n",dp(0,n-1));
}
int dp(int a,int b)
{
	int i,min=1000001;
	if(b-a<=1)
		return 0;
	else if(b-a==2)
		return (c[a]*c[a+1]*c[b]);
	else 
	{
		for(i=a+1;i<b;i++)
		{
			if(min>dp(a,i)+dp(i,b)+c[a]*c[i]*c[b])
				min=dp(a,i)+dp(i,b)+c[a]*c[i]*c[b];
		}
		return min;
	}
}
	

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator