Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<algorithm>
- using namespace std;
- int r[100001][17],v[100001];
- int main()
- {
- FILE*fin,*fout;
- int n,m,i,j,a,b,rez,l;
- fin=fopen("afisminime.in","r");
- fout=fopen("afisminime.out","w");
- fscanf(fin,"%d%d",&n,&m);
- v[1]=0;
- for(i=2;i<=n;i++)
- v[i]=1+v[i/2];
- for(i=1;i<=n;i++)
- {
- fscanf(fin,"%d",&r[i][0]);
- for(j=1;(1<<j)<=i;j++)
- r[i][j]=min(r[i-(1<<(j-1))][j-1],r[i][j-1]);
- }
- for(i=1;i<=m;i++)
- {
- fscanf(fin,"%d%d",&a,&b);
- l=v[b-a+1];
- rez=min(r[a+(1<<l)-1][l],r[b][l]);
- fprintf(fout,"%d\n",rez);
- }
- fclose(fout);
- fclose(fin);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement