Funny Positive Sequence （ZCMU暑期提高六）

There are n integers a 1,a 2,…,a n-1,a n in the sequence A, the sum of these n integers is larger than zero. There are n integers b 1,b2,…,b n-1,b n in the sequence B, B is the generating sequence of A and bi = a 1+a 2,+…+a i (1≤i≤n). If the elements of B are all positive, A is called as a positive sequence.

We left shift the sequence A 0,1,2,…,n-1 times, and get n sequences, that is showed as follows:

A(0): a1,a2,…,an-1,an

A(1): a2,a3,…,an,a1

…

A(n-2): an-1,an,…,an-3,an-2

A(n-1): an,a1,…,an-2,an-1

Your task is to find out the number of positive sequences in the set { A(0), A(1), …, A(n-2), A(n-1) }.

Input

The first line of the input contains an integer T (T <= 20), indicating the number of cases. Each case begins with a line containing one integer n (1 <= n <= 500,000), the number of elements in the sequence. The next line contains n integers ai(-2,000,000,000≤ai≤2,000,000,000,1≤i≤n), the value of elements in the sequence.

Output

For each test case, print a line containing the test case number (beginning with 1) and the number of positive sequences.

Sample Input

2
3
1 1 -1
8
1 1 1 -1 1 1 1 -1

Sample Output

Case 1: 1
Case 2: 4

 

还是没忍住，百度了

一开始没看懂意思

这题出路注意加起来都大于0，还有就是每加一项都要大于0

#include <cstdio>
#include <cstring>
#include <iostream>
#include<algorithm>

using namespace std;
const int N = 1e6;
double a[N];
int ca;
bool vis[N];
int main() {
	int T;
	scanf("%d", &T);

	while (T--) {
		int n;
		scanf("%d", &n);
		for (int i = 0; i<n; ++i) {
			scanf("%lf", &a[i]);
		}

		double  t = 0;
		memset(vis, 0, sizeof(vis));
		bool  flag = true;
		int sum = n;

		for (int i = n - 1; i >= 0; --i) {
			if (a[i] <= 0 && flag) flag = false;
			if (!flag) {
				t += a[i];
				if (t <= 0) vis[i] = true, sum--;
				else flag = true, t = 0;
			}
		}

		if (t <= 0) {
			for (int i = n - 1; i >= 0; --i) {
				t += a[i];
				if (t <= 0 && !vis[i]) {
					vis[i] = true;
					sum--;
				}
				else if (t > 0) break;
			}
		}

		printf("Case %d: %d\n", ++ca, sum);
	}
	return 0;
}