题解 | #最大连续子序列#

 # include<stdio.h>
 # include<iostream>
 # include<algorithm>
 using namespace std;
 int main(){
 	int n;
 	while(scanf("%d",&n)!=EOF)
 	{
 		if(n==0)
 		{
 			
 			
 			continue;
 			
		 }
		 int a[n];
		 int cnt=0;
		 for(int i=0;i<n;i++)
		 {
		 	scanf("%d",&a[i]);
		 	if(a[i]<0)
		 	cnt++;
		 }
 		if(cnt==n)
		{
			printf("0 %d %d\n",a[0],a[n-1]);
			continue;
		}
		
		else{
			int dp[n];
			dp[0]=a[0];
			for(int i=1;i<n;i++)
			{
				
				dp[i]=max(a[i],dp[i-1]+a[i]);
				
			}
			
			int max=-1;
			int sign; 
			for(int i=0;i<n;i++)
			{
				if(dp[i]>max)
				{
					max=dp[i];
					sign=i;
				}
			}
			printf("%d ",max);
			int sum=0;
			int i;
			for(i=sign;i>=0;i--)
			{
				  sum+=a[i];
				  if(sum==max)
				  {
				  	break;
				  	
				  }
				
			}
			printf("%d %d\n",a[i],a[sign]);
		} 		
				 
 		
	 }
 	
 	
 	
 }