莫非就是最长子序列和？
#include <iostream> using namespace std;
#define X 10002
int a[X];
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
int n;
while(cin>>n,n)
{
for(int i=0;i<n;i++)
cin>>a[i];
int max = -2001;
int sum = 0;
for(int i=0;i<n;i++)
{
sum+=a[i];
if(sum>max)
max = sum;
if(sum<0)
sum = 0;
}
if(sum>0)
cout<<"The maximum winning streak is "<<max<<"."<<endl;
else
cout<<"Losing streak."<<endl;
}
return 0;
}