看不见代码
by InversionShadow @ 2023-05-13 08:37:01
看不见
by estar_17k @ 2023-05-13 09:44:08
36
```cpp
#include<bits/stdc++.h>
using namespace std;
const int N=3e6+1000;
typedef long long ll;
inline int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
return x*f;
}
ll m,n,logn[N],a[N],x,y,f[N][30],ans,k;
void init()
{
logn[1]=0;
logn[2]=1;
for(int i=3;i<=N;i++)
{
logn[i]=logn[i/2]+1;
}
}
int main()
{
n=read();
m=read();
for(int i=1;i<=n;i++)
{
f[i][0]=read();
}
init();
for(int j=1;j<=logn[n];j++)
{
for(int i=1;i+(1<<j)-1<=n;i++)
{
f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
}
}
for(int i=1;i<=m;i++)
{
x=read();
y=read();
k=logn[y-x+1];
ans=max(f[x][k],f[y-(1<<k)+1][k]);
printf("%lld\n",ans);
}
return 0;
}
```
100
```cpp
#include<bits/stdc++.h>
using namespace std;
const int N=3e6+100;
long long a[N],f[N][22],logn[N];
inline int read()
{
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
return x*f;
}
void pre()
{
logn[1]=0;
logn[2]=1;
for(int i=3;i<=N;i++)
{
logn[i]=logn[i/2]+1;
}
}
int main()
{
int n=read(),m=read();
for(int i=1;i<=n;i++) f[i][0]=read();
pre();
for(int j=1;j<=logn[n];j++)
{
for(int i=1;i+(1<<j)-1<=n;i++)
{
f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
}
}
long long x,y,k,ans;
for(int i=1;i<=m;i++)
{
x=read();
y=read();
k=logn[y-x+1];
ans=max(f[x][k],f[y-(1<<k)+1][k]);
printf("%lld\n",ans);
}
return 0;
}
```
by 没见过AC @ 2023-05-13 12:47:50
@[ydq1101](/user/672281)
by 没见过AC @ 2023-05-13 12:48:06
@[stxowp](/user/724855)
by 没见过AC @ 2023-05-13 12:48:13
@[没见过AC](/user/415320) 预处理数组越界了，改了就过了
by ForgotDream_CHN @ 2023-05-13 19:49:11
@[ForgotDream_CHN](/user/750067) woc,谢谢您，但是下面的似乎也越界了但却AC了
by 没见过AC @ 2023-05-13 19:58:01
@[没见过AC](/user/415320) 这个比较玄学
by ForgotDream_CHN @ 2023-05-13 20:29:31