提出 b7683d9d-51b3-4d6d-be06-ff984285558e

コード

#include <bits/stdc++.h>
using namespace std;

int main(){
    int n,N = 1;
    cin >> n;
    while(n > N) N *= 2;
    cerr << N << endl;
    vector<long long> seg(2*N,0);
    for(int i = 0;i < n;i++){
        cin >> seg[i+N];
    }
    for(int i = N-1;i > 0;i--){
        seg[i] = max(seg[i*2],seg[i*2+1]);
    }
    for(int i = 1;i < 2*N;i++) cerr << i << ":" << seg[i] << " ";
    cerr << endl;
    int D;
    cin >> D;
    for(int i = 0;i < D;i++){
        int L,R,X,A,B;
        cin >> L  >> R >> X >> A >> B;
        L--,R--;
        for(int j = L+N;j <= R+N;j++) seg[j] += X;
        for(int j = N-1;j > 0;j--) seg[j] = max(seg[j*2],seg[j*2+1]);
        //
        A += (N-1),B += N;
        long long ans = 0;
        cerr << "A:" << A << ",B:" << B << ",ans:" << ans << endl;
        while(A != B && A < B){
          if(A % 2 == 1){
            ans = max(ans,seg[A]);
            A++;
          } 
          if(B % 2 == 1){
            B--;
            ans = max(ans,seg[B]);
          }
          A /= 2;
          B /= 2;
          cerr << "A:" << A << ",B:" << B << ",ans:" << ans << endl;
        }
        cout << ans << endl; 
        //
        for(int j = 1;j < 2*N;j++) cerr << j << ":" << seg[j] << " ";
        cerr << endl;
    }
}

結果

問題	点数	言語	結果	実行時間	メモリ
H - Gardening Diary	0	C++	TLE	2104 ms	7540 KiB