BZOJ 1084 最大子矩阵

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

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

#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
int f[1005][1005],F[1005][1005][11];
int sum[10005],sum1[10005],sum2[10005],n,m,K;
int read(){
    int t=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while ('0'<=ch&&ch<='9'){t=t*10+ch-'0';ch=getchar();}
    return t*f;
}
void sxpianfen1(){
    for (int i=1;i<=n;i++)
     {int x=read();sum[i]=sum[i-1]+x;}      
    for (int i=1;i<=n;i++)
     for (int k=1;k<=K;k++){
      f[i][k]=f[i-1][k];
      for (int j=0;j<i;j++)
       f[i][k]=std::max(f[i][k],f[j][k-1]+sum[i]-sum[j]);
    } 
    printf("%d
",f[n][K]);
}
void sxpianfen2(){
    for (int i=1;i<=n;i++){
        int x=read(),y=read();
        sum1[i]=sum1[i-1]+x;
        sum2[i]=sum2[i-1]+y;
    }
    for (int k=1;k<=K;k++)
     for (int i=1;i<=n;i++)
      for (int j=1;j<=n;j++){
         F[i][j][k]=std::max(F[i-1][j][k],F[i][j-1][k]);
         for (int l=0;l<i;l++) F[i][j][k]=std::max(F[i][j][k],F[l][j][k-1]+sum1[i]-sum1[l]);
         for (int l=0;l<j;l++) F[i][j][k]=std::max(F[i][j][k],F[i][l][k-1]+sum2[j]-sum2[l]);
         if (i==j)
         for (int l=0;l<i;l++) F[i][j][k]=std::max(F[i][j][k],F[l][l][k-1]+sum1[i]+sum2[j]-sum1[l]-sum2[l]);
      }
    printf("%d
",F[n][n][K]);  
}
int main(){
    n=read();m=read();K=read();
    if (m==1){
        sxpianfen1();
    }else
        sxpianfen2();
}