Pagini recente » Cod sursa (job #3192038) | Cod sursa (job #803541) | Cod sursa (job #2327701) | Cod sursa (job #2827450) | Cod sursa (job #2790578)
#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;
}