Submission #3791006

---

Source Code Expand

#include <iostream>
#include <string>
#include<algorithm>
#include <vector>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<numeric>
using namespace std;

typedef long long ll;
#define modulo 1000000007 // 10^9 + 7
#define MAX 1000000000 // 10^9



int main() {
	int N; cin >> N;
	ll a[N + 1];

	a[0] = 0;
	for (int i = 1; i <= N; i++) {
		int b; cin >> b;
		a[i] = a[i - 1] + b;
	}

	// sortすることでNlogNのオーダーにする
	sort(a, a + (N + 1));

	/*
	for (int i = 0; i <= N; i++) {
		cout << a[i] << " ";
	}
	*/

	ll ans = 0;
	ll temp = a[0];
	int temp_count = 1;
	for (int i = 1; i <= N; i++) {
		if (temp == a[i]) {
			ans += temp_count;
			temp_count++;
		}
		else {
			temp = a[i];
			temp_count = 1;
		}
	}
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result