@[夜阑](/user/243263) 加了快读您查询时没用啊
by 崔化博 @ 2022-08-03 09:56:02
```
把 cout 换成 printf ，把 cin 换成快读就 A 了
by 崔化博 @ 2022-08-03 09:58:33
@[崔化博](/user/304524) 啊一定要用printf吗，我语法课没怎么学不会，，，
by 夜阑 @ 2022-08-03 10:00:15
额，您可以关闭流同步
by 崔化博 @ 2022-08-03 10:00:43
```cpp
ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
by 崔化博 @ 2022-08-03 10:01:06
@[崔化博](/user/304524) emmm把lr换成了快读，加上了std::ios::sync_with_stdio(false);还是TLE呀emmm
by 夜阑 @ 2022-08-03 10:03:52
@[夜阑](/user/243263) 还是用 printf 吧，把输出改成
```cpp
printf("%d\n",max(f[l][x],f[r-(1<<x)+1][x]));
就可以了
by 崔化博 @ 2022-08-03 10:04:35
@[崔化博](/user/304524) 嗯嗯,AC了蟹蟹
by 夜阑 @ 2022-08-03 10:05:45
AC代码
```
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=100005;
int T,n,m,ans;
int dp[N][25];
int main()
{
int i,j,k,x,y;
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d",&dp[i][0]);
}
for(j=1;j<=21;j++){
for(i=1;i+(1<<j)-1<=n;i++){
dp[i][j]=max(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
}
}
while(m--){
scanf("%d %d",&x,&y);
k=log2(y-x+1);
//k=0;while(1<<(k+1)<=y-x+1) k++;
printf("%d\n",max(dp[x][k],dp[y-(1<<k)+1][k]));//取交集 2^(k-1) <= x-y+1 <= 2^k
}
return 0;
}
by WANG_ZHENG_MING @ 2022-08-03 10:29:49