제출 #1115079

#제출 시각아이디문제언어결과실행 시간메모리
1115079Zero_OPFire (JOI20_ho_t5)C++14
1 / 100
206 ms262144 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

#ifdef LOCAL
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
#endif // LOCAL

    int N, Q;
    cin >> N >> Q;
    vector<int> S(N + 1);
    for(int i = 1; i <= N; ++i) cin >> S[i];

    vector<vector<int>> F(N + 1, vector<int>(N + 1));

    F[0] = S;
    for(int t = 1; t <= N; ++t){
        for(int i = 1; i <= N; ++i){
            F[t][i] = max(F[t - 1][i - 1], F[t - 1][i]);
        }
    }

    for(int i = 1; i <= Q; ++i){
        int t, l, r;
        cin >> t >> l >> r;
        t = min(t, N);
        long long total = 0;
        for(int j = l; j <= r; ++j) total += F[t][j];
        cout << total << '\n';
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...