Cod sursa(job #1254845)
Utilizator | Data | 3 noiembrie 2014 16:43:51 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<cstdio>
int ;
int min(int a,int b)
{
if(a<b) return a;
else return b;
}
int main()
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d",&x[i]);
dp[i][0]=x[i];
}
for(i=n;i>=1;i--)
{
for(j=1;(1<<j)+i-1<=n;l++)
{
dp[i+(1<<(j-1))][j-1]
}
}
return 0;
}