HDU1003Max Sum（dp）

Description
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

思路：大致跟这一篇一样，只是输出格式比较麻烦。点击这里。这道题输出注意每组测试数据之间要空一行。但不能直接\n\n因为这样最后一组也会空一行会wa（别问我为什么知道）其他的就没什么了。

代码：

#include<bits/stdc++.h>  
using namespace std;  
int a[100010];  
int dp[100010];  
int main()  
{  
    int t,k=1;  
    scanf("%d",&t);
    for(int j=1;j<=t;j++)
    {  
    	int n;
    	scanf("%d",&n);
        int ma=-1111,s1=1,e1=0,s2,e2;  
        memset(dp,0,sizeof(dp));  
        memset(a,0,sizeof(a));  
        for(int i=1;i<=n;i++)  
        {  
        scanf("%d",&a[i]);    
        dp[i]=max(dp[i-1]+a[i],a[i]);  
        if(dp[i]==a[i]&&a[i]!=dp[i-1]+a[i])  
        {  
        	s1=i;  
        	e1=i;  	
        }  
        else  
        {  
            e1=i;  
        }  
        if(dp[i]>ma)  
        {  
            ma=dp[i];  
            s2=s1;  
            e2=e1;  
        }  
        }  
        printf("Case %d:\n%d %d %d\n",k++,ma,s2,e2); 
		 if(j!=t)
		 printf("\n");
    }  
    return 0;  
}