HDU 5783 Divide the Sequence 2016 Multi-University Training Contest 5

Divide the Sequence

Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2232 Accepted Submission(s): 628

Problem Description
Alice has a sequence A, She wants to split A into as much as possible continuous subsequences, satisfying that for each subsequence, every its prefix sum is not small than 0.

Input
The input consists of multiple test cases.
Each test case begin with an integer n in a single line.
The next line contains n integers A1,A2⋯An.
1≤n≤1e6
−10000≤A[i]≤10000
You can assume that there is at least one solution.

Output
For each test case, output an integer indicates the maximum number of sequence division.

Sample Input
6
1 2 3 4 5 6
4
1 2 -3 0
5
0 0 0 0 0

Sample Output
6
2
5
给出一个串问最多可以分割成几个任意前缀和是>=0的子串。
补多校题。发现这不是大水题吗从后往前倒着贪心一下维护sum就好了。。为什么过得比最后一题还少。。。这代码才几行

#include <cstdio>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
#define MAX 1000005
long long num[MAX];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=1;i<=n;i++)
            scanf("%lld",&num[i]);
        long long ans=0,sum=0;
        for(int i=n;i>=1;i--)
        {
            if(sum+num[i]>=0)
            {
                ans++;
                sum=0;
            }
            else
            {
                sum+=num[i];
            }
        }
        printf("%lld\n",ans);
    }
}