hdu3280Equal Sum Partitions (区间DP)

#include<bits/stdc++.h>
using namespace std;

/*
ÁîF[i][j]ΪÐòÁÐi----j±»·Ö³ÉÈô¸É¶ÎµÄ×îСºÍ
F[i][j]=min(if(F[i][k]==F[k+1][j])F[i][k],else sum[i][j] ,F[i][j]) 
*/

int p,c,n,a[10005],f[7005][7005];

int main(){
	cin>>p;
	for(int cishu=1;cishu<=p;cishu++){
		cin>>c>>n;a[0]=0;memset(f,0x3f,sizeof(f));
		for(int i=1;i<=n;i++){
		cin>>a[i];
		f[i][i]=a[i];	
		a[i]+=a[i-1];
		}
		for(int len=2;len<=n;len++){
			for(int i=1;i+len-1<=n;i++){
				int j=i+len-1;f[i][j]=a[j]-a[i-1];
				for(int k=i;k<j;k++){
					if(f[i][k]==f[k+1][j])f[i][j]=min(f[i][j],f[i][k]);
					if(a[k]-a[i-1]==a[j]-a[k])f[i][j]=min(f[i][j],a[k]-a[i-1]);
					if(a[k]-a[i-1]==f[k][j])f[i][j]=min(f[i][j],f[k][j]);
					if(a[j]-a[k]==f[i][k])f[i][j]=min(f[i][j],f[i][k]);
					
				}
				//cout<<i<<"   "<<j<<"   "<<f[i][j]<<endl;
			}
		}
		cout<<c<<" "<<f[1][n]<<endl;
	}
}