最大连续和 (基础dp)

Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. 

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000). 

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases. 

Sample Input

2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output

Case 1:
14 1 4

Case 2:
7 1 6

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int dp[maxn];
int main()
{
    int n,t,m;
    scanf("%d",&t);
    for(int k=1;k<=t;k++)
    {
        scanf("%d",&n);
        int L,R,ansL,ansR;
        int ans=-1000000000,s=-1000000000;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&m);
            if(s<0)
            {
                s=m;
                L=i+1;
                R=i+1;
            }
            else
            {
                s+=m;
                R++;
            }
            if(ans<s)
            {
                ans=s;
                ansL=L;
                ansR=R;
            }
        }
        if(k!=1) printf("\n");
        printf("Case %d:\n",k);
        printf("%d %d %d\n",ans,ansL,ansR);

    }
}

Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. 
As an example, the maximal sub-rectangle of the array: 

0 -2 -7 0 
9 2 -6 2 
-4 1 -4 1 
-1 8 0 -2 
is in the lower left corner: 

9 2 
-4 1 
-1 8 
and has a sum of 15. 

Input

The input consists of an N * N array of integers. The input begins with a single positive integer N on a line by itself, indicating the size of the square two-dimensional array. This is followed by N^2 integers separated by whitespace (spaces and newlines). These are the N^2 integers of the array, presented in row-major order. That is, all numbers in the first row, left to right, then all numbers in the second row, left to right, etc. N may be as large as 100. The numbers in the array will be in the range [-127,127].

Output

Output the sum of the maximal sub-rectangle.

Sample Input

4
0 -2 -7 0 9 2 -6 2
-4 1 -4  1 -1

8  0 -2

Sample Output

15

二维转为一维，再求最大连续和。

#include<bits/stdc++.h>
using namespace std;
int n,a[105][105];
int s[105][105];
int main()
{
    scanf("%d",&n);
    memset(a,0,sizeof(a));
    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];
        }
    }
    int sum=-9999999;
    for(int i=1;i<=n;i++)
    {
        for(int j=i;j<=n;j++)
        {
            int ans=-9999999,ss=-9999999;
            for(int k=1;k<=n;k++)
            {
                int key=s[j][k]-s[i-1][k];
                if(ss<0) ss=key;
                else ss+=key;
                ans=max(ans,ss);
            }
            sum=max(sum,ans);
        }

    }
    printf("%d\n",sum);
}