-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
57 lines (45 loc) · 880 Bytes
/
C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<ll> pref(n + 10, 0);
for (int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + a[i];
}
ll ans = 0, maxfreq = 0, flag = 1;
map<ll, ll> mp;
for (int i = 1; i <= n; i++) {
if (a[i] == 0) {
if (flag) ans += mp[0];
else ans += maxfreq;
flag = 0;
maxfreq = 0;
mp.clear();
}
maxfreq = max(maxfreq, ++mp[pref[i]]);
}
if (!flag) ans += maxfreq;
else ans += mp[0];
cout << ans << '\n';
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//freopen("Error.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}