#define LL long long
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REV(i,n) for(int i=n-1;i>=0;i--)
#define pri(a) cout << a << endl;
#define prii(a,b) cout << a << " " << b << endl;
using namespace std;
int main()
{
int n,a[12345];
while(cin>>n and n)
{
REP(i,n) cin>>a[i];
LL sm=0,res=0;
REP(i,n)
{
sm += a[i];
if(sm<=0) sm = 0;
else res = max(sm,res);
}
if(res>0) printf("The maximum winning streak is %lld.\n", res);
else puts("Losing streak.");
}
return 0;
}
No comments:
Post a Comment