Submission 471
Return to ProblemUser: admin
Language: cpp
Submitted at: Nov. 9, 2025, 7:48 p.m.
Elapsed Time: 95.70 s
Keys per Minute (KPM): 312.84
Status: AC
Test Case Results:
| # | Status | Time (s) | Error |
|---|---|---|---|
| 1 | AC | 1.875 | - |
| 2 | AC | 1.958 | - |
#include <iostream>
using namespace std;
int a[100005][20];
main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,q;
cin>>n>>q;
for (int i=1;i<=n;i++) cin>>a[i][0];
for (int k=1;k<19;k++) for (int i=1;i+(1<<(k-1))<=n;i++) a[i][k]=max(a[i][k-1],a[i+(1<<(k-1))][k-1]);
while (q--){
int l,r,k;
cin>>l>>r;
k=__lg(r-l+1);
cout<<max(a[l][k],a[r-(1<<k)+1][k])<<"\n";
}
}