http://www.lydsy.com/JudgeOnline/problem.php?id=1084

思路:分m=1和m=2操作

1 #include
     
       2 #include
      
        3 #include
       
         4 #include
        
          5 #include
         
           6 int f[1005][1005],F[1005][1005][11]; 7 int sum[10005],sum1[10005],sum2[10005],n,m,K; 8 int read(){ 9     int t=0,f=1;char ch=getchar();10     while (ch<'0'||ch>'9'){
   if (ch=='-') f=-1;ch=getchar();}11     while ('0'<=ch&&ch<='9'){t=t*10+ch-'0';ch=getchar();}12     return t*f;13 }14 void sxpianfen1(){15     for (int i=1;i<=n;i++)16      {
   int x=read();sum[i]=sum[i-1]+x;}      17     for (int i=1;i<=n;i++)18      for (int k=1;k<=K;k++){19       f[i][k]=f[i-1][k];20       for (int j=0;j