UVa 10684 - The Jackpot

#include <bits/stdc++.h>
#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 pri(a) cout<<a<<endl
#define prii(a,b) cout<<a<<" "<<b<<endl
#define hi printf("Hello World\n")
#define pcs printf("CASE# %d:\n", ++cs);
#define WRITE(fn) freopen(fn, "w", stdout);
using namespace std;

///This is an maximum sub array sum problem.
///Here we need find maximum subarray sum in 1D array.

int main()
{
    int mx,n,x,sm;

    while(cin>>n and n)
    {
        mx = sm = 0;

        REP(i,n)
        {
            cin>>x;

            sm += x;

            mx = max(sm,mx);

            if(sm < 0) sm = 0;
        }

        if(mx) printf("The maximum winning streak is %d.\n", mx);
        else pri("Losing streak.");
    }

    return 0;
}