提出 #22665590

---

ソースコード 拡げる

#include<iostream>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
#define int long long
#define ll long long
#define vel vector<int>
#define vvel vector<vel>
#define vvvel vector<vvel>
#define veb vector<bool>
#define pin pair<int,int>
#define mkp make_pair
#define mot pair<D,D>//time,dist
#define root pair<int,mot>
using namespace std;
vvel ta_min(0);
vvel ta_max(0);
int leth = 1024 * 512;
int siz = leth * 2;
void mmax(ll& a, ll b) { a = max(a, b); }
void mmin(ll& a, ll b) { a = min(a, b); }
int sum(int n) {
	if (n == 0) { return 0; }
	return n % 10 + sum(n / 10);
}
signed main() {
	int n; cin >> n;
	vel sum(n + 1, 0);
	for (int i = 0; i < n; i++) { 
		int a; cin >> a; 
		if (i % 2 == 0) { a *= -1; }
		sum[i + 1] = sum[i] + a;
	}
	sort(sum.begin(), sum.end());
	int ans = 0;
	for (int i = 0; i <= n; i++) { ans += i - (lower_bound(sum.begin(), sum.end(), sum[i]) - sum.begin()); }
	cout << ans << endl;
	return 0;
}

提出情報

ジャッジ結果