Submission #989982

#TimeUsernameProblemLanguageResultExecution timeMemory
989982AcanikolicTriple Jump (JOI19_jumps)C++14
0 / 100
936 ms403608 KiB
#include <bits/stdc++.h> #define int long long #define pb push_back #define F first #define S second using namespace std; const long long N = 5000 + 10; const long long mod = 998244353; const long long inf = 1e9; int mx[N][N]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int>a(n + 1); for(int i = 1; i <= n; i++) cin >> a[i]; for(int i = 1; i <= n; i++) { int M = a[i]; for(int j = i; j <= n; j++) { M = max(M,a[j]); mx[i][j] = M; } } int q; cin >> q; while(q--) { int l,r; cin >> l >> r; int res = 0; for(int i = l + 1; i + 1 <= r; i++) { int index = 2 * i - r; index = max(index,l); res = max(res,a[i] + mx[i + 1][r] + mx[index][i - 1]); } cout << res << "\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...