Cod sursa(job #1562119)
Utilizator | Bajan Vlad baji | Data | 4 ianuarie 2016 20:17:15 |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int i,j,mini,n,m,x,v[100001],y /*,a[10000][10000]*/;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>v[i];
// a[i][i]=v[i];
}
/*
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
a[i][j]=min(a[i][j-1],v[j]);
for(i=1;i<=m;i++)
{
fin>>x>>y;
fout<<a[x][y]<<'\n';
}
*/
for(i=1;i<=m;i++)
{
fin>>x>>y;
mini=v[x];
for(j=x+1;j<=y;j++)
if(v[j]<mini)
mini=v[j];
fout<<mini<<'\n';
}
return 0;
}