#MIS #MIS1D #UVa #Solved

10684 - The jackpot.cpp

//https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1625
#include <bits/stdc++.h>

#define ll long long
#define sz(v) ((int) ((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define lp(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep(i, v) for(int i = 0; i < sz(v); ++i)

using namespace std;

const int MAX = 15;
const int OO = 1e4;
int n, m;

int main() {
    int x, best, sum;
    while(cin>>n && n!= 0) {
        best = 0;
        sum = 0;
        lp(i, n) {
            cin>>x;
            if(sum < 0) sum = x;
            else sum += x;
            if(sum > best) best = sum;
        }
        if(best)
            cout << "The maximum winning streak is " << best << "." << endl;
        else
            cout << "Losing streak." << endl;
    }
    return 0;
}