#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector <int> pref(n + 1); for (int i = 1; i <= n; i++) { cin >> pref[i]; pref[i] += pref[i - 1]; } vector <int> v; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { v.push_back(pref[j] - pref[i - 1]); } } map <int, vector <int>> pos; for (int i = 0; i < v.size(); i++) { pos[v[i]].push_back(i); } int ans = 0; for (int i = 0; i < v.size(); i++) { for (int j = i + 2; j < v.size(); j++) { int s = (v[i] + v[j]) * (-1); auto it1 = lower_bound(pos[s].begin(), pos[s].end(), i + 1), it2 = lower_bound(pos[s].begin(), pos[s].end(), j); ans += it2 - it1; } } cout << ans << '\n'; }
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector <int> pref(n + 1); for (int i = 1; i <= n; i++) { cin >> pref[i]; pref[i] += pref[i - 1]; } vector <int> v; for (int i = 1; i <= n; i++) { for (int j = i; j <= n; j++) { v.push_back(pref[j] - pref[i - 1]); } } map <int, vector <int>> pos; for (int i = 0; i < v.size(); i++) { pos[v[i]].push_back(i); } int ans = 0; for (int i = 0; i < v.size(); i++) { for (int j = i + 2; j < v.size(); j++) { int s = (v[i] + v[j]) * (-1); auto it1 = lower_bound(pos[s].begin(), pos[s].end(), i + 1), it2 = lower_bound(pos[s].begin(), pos[s].end(), j); ans += it2 - it1; } } cout << ans << '\n'; } |