Cod sursa(job #1493353)
Utilizator | Ionut Morosan SirStevens | Data | 29 septembrie 2015 08:46:40 |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,x,y,m,v[100000],c[100000],k,cop;
void citire()
{
for(int i=1;i<=n;i++)
in>>v[i];
}
int main()
{
in>>n>>m;
citire();
while(m)
{
in>>x>>y;
for(int i=x;i<=y;i++)
{
for(int j=1;j<=n;j++)
if(i==v[j])
{
k++;
c[k]=v[j];
j=n+1;
cop=j;
}
if(cop==n+1)
i=y+1;
}
m--;}
for(int i=1;i<=k;i++)
{
out<<c[i]<<'\n';
}
return 0;
}