JZOJ5838 旅游路线

 1 #include<cstdio>
 2 using namespace std;
 3 int n,k,ma,a[300][300],s[300][300];
 4 int main()
 5 {
 6     scanf("%d%d",&n,&k);
 7     for (int i=1;i<=n;i++)
 8         for (int j=1;j<=k;j++)
 9         {
10             scanf("%d",&a[i][j]);
11             s[i][j]=s[i][j-1]+a[i][j];
12         } 
13     ma=0;
14     for (int i=1;i<=k;i++)
15         for (int j=i+1;j<=k;j++)
16         {
17             int ss=0;
18             for (int p=1;p<=n;p++)
19             {
20                 ss=ss+s[p][j]-s[p][i-1];
21                 if (ss<0) ss=0;
22                 if (ss>ma) ma=ss;
23             }
24         }
25     printf("%d",ma);
26 }