#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int, int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
template<class I> bool chmin(I&a, I b){ return a > b ? (a=b, true) : false; }
template<class I> bool chmax(I&a, I b){ return a < b ? (a=b, true) : false; }
#ifdef OWO
#define debug(args...) LKJ("\033[1;32m[ " + string(#args) + " ]\033[0m", args)
template<class I> void LKJ(I&&x){ cerr << x << endl; }
template<class I, class...T> void LKJ(I&&x, T&&...t){ cerr << x << ", "; LKJ(t...); }
template<class I> void OI(I a, I b){ while(a < b) cerr << *a << " \n"[next(a) == b], ++a; }
#else
#define debug(...) 0
#define OI(...) 0
#endif
#define int ll
// const int kN = 500005;
const int kN = 5005;
int N, Q, A[kN];
int L[kN], R[kN];
void input(){
cin >> N;
for(int i = 1; i <= N; ++i)
cin >> A[i];
cin >> Q;
for(int i = 0; i < Q; ++i)
cin >> L[i] >> R[i];
}
int rm[kN][kN];
int ans[kN][kN];
void solve(){
for(int i = 1; i <= N; ++i){
for(int j = i; j <= N; ++j)
rm[i][j] = max(rm[i][j-1], A[j]);
}
for(int i = 1; i <= N; ++i){
for(int j = i+2; j <= N; ++j){
ans[i][j] = A[i] + A[j] + rm[i+1][i+(j-i)/2];
}
}
for(int i = 1; i <= N; ++i)
for(int j = i+2; j <= N; ++j)
ans[i][j] = max(ans[i][j], ans[i][j-1]);
for(int i = N-1; i >= 1; --i)
for(int j = i+2; j <= N; ++j)
ans[i][j] = max(ans[i][j], ans[i+1][j]);
for(int i = 0; i < Q; ++i)
cout << ans[L[i]][R[i]] << '\n';
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
input();
solve();
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1100 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 11 |
Incorrect |
218 ms |
234340 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
206 ms |
596 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 7 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 8 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 9 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 10 |
Correct |
1 ms |
1100 KB |
Output is correct |
| 11 |
Incorrect |
218 ms |
234340 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
