Cod sursa(job #929373)
| Utilizator | Data | 26 martie 2013 23:39:14 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int c[100001],n,m,i,j,mini,x,y;
int a[5000][5000];
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for(i=1;i<=n;i++)fin>>c[i];
for(i=1;i<=n;i++)
{
a[i][i]=c[i];
mini=c[i];
for(j=i+1;j<=n;j++)
{
if(c[j]<mini)mini=c[j];
a[i][j]=mini;
}
}
for(i=1;i<=m;i++)
{
fin>>x>>y;
fout<<a[x][y]<<"\n";
}
fin.close();
fout.close();
return 0;
}
