#include <iostream>
#include <map>
#include <vector>
using namespace std;
using ll = long long;
const int MAXN = 100000;
int a[MAXN];
signed main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
map<ll, int> mp;
mp[0] = -1;
ll psm = 0;
for (int i = 0; i < n; ++i) {
psm += a[i];
if (mp.find(psm) == mp.end()) {
a[i] = -2;
} else {
a[i] = mp[psm];
}
if (i && a[i - 1] > a[i])
a[i] = a[i - 1];
mp[psm] = i;
}
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
--l;
vector<int> dp_(r - l, 0);
auto dp = dp_.begin() - l;
for (int i = l; i < r; ++i) {
if (i)
dp[i] = dp[i - 1];
if (a[i] + 1 >= l)
dp[i] = max(dp[i], dp[a[i]] + 1);
}
cout << dp[r - 1] << endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
456 KB |
Output is correct |
2 |
Correct |
34 ms |
588 KB |
Output is correct |
3 |
Correct |
59 ms |
632 KB |
Output is correct |
4 |
Correct |
49 ms |
460 KB |
Output is correct |
5 |
Correct |
33 ms |
460 KB |
Output is correct |
6 |
Correct |
58 ms |
588 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
456 KB |
Output is correct |
2 |
Correct |
34 ms |
588 KB |
Output is correct |
3 |
Correct |
59 ms |
632 KB |
Output is correct |
4 |
Correct |
49 ms |
460 KB |
Output is correct |
5 |
Correct |
33 ms |
460 KB |
Output is correct |
6 |
Correct |
58 ms |
588 KB |
Output is correct |
7 |
Execution timed out |
1065 ms |
4484 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
456 KB |
Output is correct |
2 |
Correct |
34 ms |
588 KB |
Output is correct |
3 |
Correct |
59 ms |
632 KB |
Output is correct |
4 |
Correct |
49 ms |
460 KB |
Output is correct |
5 |
Correct |
33 ms |
460 KB |
Output is correct |
6 |
Correct |
58 ms |
588 KB |
Output is correct |
7 |
Execution timed out |
1065 ms |
4484 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |