ACM 10684 The jackpot

標準Maximum Subarray題目


#include <stdio.h>

int main(void)
{
    int i, n, bet, sum, max;
   
    while (scanf("%d", &n) == 1 && n)
    {
        max = sum = 0;
        for (i = 0; i < n; i++)
        {
            scanf("%d", &bet);
            sum += bet;
            if (sum > max)
                max = sum;
            if (sum < 0)
                sum = 0;
        }
       
        if (max)
            printf("The maximum winning streak is %d.\n", max);
        else
            printf("Losing streak.\n");
    }
   
    return 0;
}