Pagini recente » Cod sursa (job #2323757) | Cod sursa (job #1545262) | Cod sursa (job #2830850) | Cod sursa (job #2465229) | Cod sursa (job #2750531)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
int main(){
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
fin >> n >> m;
int numere[n+1];
int minime[n+1][n+1];
for( int i = 1; i <= n; i++ ){
for( int j = 1; j <=n; j++ ){
minime[i][j] = 100001;
}
}
for( int i = 1; i <= n; i++ ){
int numar;
fin >> numar;
numere[i] = numar;
for( int l = 0; l <= i; l++ ){
for( int j = i; j <= n; j++ ){
if( minime[l][j] > numar ) minime[l][j] = numar;
}
}
}
for( int i = 1; i <= m; i++ ){
int a, b;
fin >> a >> b;
fout << minime[a][b] << endl;
}
}