Cod sursa(job #620706)
| Utilizator | Data | 16 octombrie 2011 15:47:28 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int main(void){
int n,m,i,j,x,y;
f>>n>>m;
int v[n+1][n+1];
for(i=1;i<=n;i++){
f>>x;
v[0][i]=x;
v[i][0]=x;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
v[i][j]=min(v[0][j],v[i][0]);
/*for(i=0;i<=n;i++){
for(j=0;j<=n;j++)
cout<<v[i][j]<<" ";
cout<<"\n";
}
cout<<"\n";*/
for(i=0;i<m;i++){
f>>x>>y;
g<<v[x][y]<<"\n";
}
f.close();
f.close();
}
