Cod sursa(job #2790578)
| Utilizator | Data | 29 octombrie 2021 11:27:09 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
using namespace std;
int main(){
int N, M, i, j, nr, st, dr;
cin>>N>>M;
int a[N], m[N][N];
for(int i=0; i<N; i++)
cin>>a[i];
for(int i=0; i<N; i++)
m[i][i]=a[i];
for(int j=1; j<N; j++)
{
nr=j;
for(i=0; i<N-j; i++)
{
m[i][nr]=min(m[i+1][nr], m[i][nr-1]);
nr++;
}
}
while(M)
{
cin.ignore();
cin >> st >> dr;
cout << m[st-1][dr-1] << '\n';
M--;
}
return 0;
}
