This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#ifndef DEBUG
#define cerr if (0) cerr
#define endl '\n'
#endif
const ll maxn=105;
const ll inf=1e15;
ll arr[maxn];
ll solve(ll l, ll r){
ll ans=0;
for (int i=l;i<=r;i++){
for (int j=i+1;j<=r;j++){
for (int k=j+1;k<=r;k++){
if (j-i>k-j) continue;
ans=max(ans,arr[i]+arr[j]+arr[k]);
}
}
}
return ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
for (int i=1;i<=n;i++) cin>>arr[i];
ll q,l,r;
cin>>q;
for (int i=1;i<=q;i++){
cin>>l>>r;
cout<<solve(l,r)<<endl;
}
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... |