希望更丰富的展现？使用Markdown
by vocaloid @ 2019-01-22 15:08:02
#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int n,m,l,r,a[1000001],f[100001][21];
void yuchuli(int n){
for(int i=1;i<=n;i++)
f[i][0]=a[i];
for(int j=1;j<=20;++j)
for(int i=1;i<=n;++i)
if(i+(1<<j)-1<=n)
f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
return;
}
void pd(int i,int j){
int k=log(j-i+1)/log(2);
int asdf=max(f[i][k],f[j-(1<<k)+1][k]);
printf("%d\n",asdf);
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",a[i]);
yuchuli(n);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&l,&r);
pd(l,r);
}
return 0;
}
by 王政骁 @ 2019-01-22 15:08:13
scanf("%d",a[i]);
这里面要用地址符！！！！！！
by Nirvous @ 2019-01-22 15:12:18
@[一叶知秋叶秋](/space/show?uid=95323)
by Nirvous @ 2019-01-22 15:12:49
ylt
by 王政骁 @ 2019-01-22 15:12:50
？
by 王政骁 @ 2019-01-22 15:12:58
@[一叶知秋叶秋](/space/show?uid=95323)
```scanf("%d",&a[i]);```
by qian_shang @ 2019-01-22 15:20:34
谢谢各位大佬
by 王政骁 @ 2019-01-22 15:21:53
考古
by Liu_zj @ 2019-10-05 17:33:00