#include <bits/stdc++.h>
using namespace std;
/*
    SAPO 2025 TC4 Day 1 - Train Station
    copied from JO1 2019 - Triple Jump
    5/100 pt solution here
*/
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    vector<int> c(n); for (int i = 0; i < n; i++) cin >> c[i];
    int q; cin >> q;
    for (int qc = 0; qc < q; qc++) {
        int l, r; cin >> l >> r;
        l--; r--;
        int best = 0;
        for (int x = l; x <= r; x++) {
            for (int y = x + 1; y <= r; y++) {
                for (int z = y + 1; z <= r; z++) {
                    if (!(y - x <= z - y)) continue;
                    best = max(best, c[x] + c[y] + c[z]);
                }
            }
        }
        cout << best << "\n";
    }
    return 0;
}
| # | 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... |