HDU1081

来源：互联网发布：绘图设计软件编辑：程序博客网时间：2024/05/22 03:52
/*vector_change --- HDU1081*/#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#define INT_MIN 0x80000000#define INT_MAX 0x7fffffff#define N 110#define MAX(a,b) (a)>(b)?(a):(b)#define LL long long#define debug(x) cout<<#x<<":"<<(x)<<endl;using namespace std;int a[N][N];int s[N][N];int max_rec(int t[],int n)  //最大连续子序列{    int m = 0;    int ans=t[1];    for(int i=1; i<=n; i++)    {        m = MAX(t[i], m+t[i]);        if(ans < m) ans=m;    }    return ans;}//15-2-5int main(){   // freopen("1.txt", "r", stdin);    int n;    while( ~scanf("%d", &n) )    {        //input. initial        memset(a,0,sizeof(a));        for( int i=0; i<=n; i++)            s[i][0]=s[0][i]=0;        for( int i=1; i<=n; i++)            for( int j=1; j<=n; j++)            {                scanf("%d", &a[i][j]);                s[i][j] = s[i-1][j] + a[i][j];            }        // s[i][j]  指的是 第j列的 1~i的和        int ans = INT_MIN;        int t[N];        int m;        for(int i=0; i<=n; i++)            for( int j=i+1; j<=n; j++)            {                for( int k=1; k<=n; k++)                {                    t[k] = s[j][k] - s[i][k];                }                m = max_rec(t, n);                if( m > ans ) ans = m;            }        printf("%d\n", ans);    }    return 0;}
0 0