This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, q, a[510];
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
cin >> q;
while(q--){
int t, l, r; cin >> t >> l >> r;
if(t==1) a[l]=r;
else{
int ans = 0;
for(int i = l; i <= r; i++){
int cur = a[i], j=i-1,k=i+1;
while((j>=l and cur>=a[j]) or (k<=r and cur>=a[k])){
if(j>=l and cur>=a[j]) cur+=a[j--];
if(k<=r and cur>=a[k]) cur+=a[k++];
}
if(cur==accumulate(a+l,a+r+1,0ll)) ans++;
}
cout << ans << "\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |