Pagini recente » Cod sursa (job #1901439) | Cod sursa (job #680538) | Cod sursa (job #1611691) | Cod sursa (job #1663621) | Cod sursa (job #357652)
Cod sursa(job #357652)
#include <fstream>
#include <vector>
using namespace std;
int n, m, i, j, x, y;
vector<int> a;
vector<vector<int> > b;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main()
{
fin >> n >> m;
for ( i = 1; i <= n; i++)
{
fin >> x;
a.push_back(x);
}
for ( i = 1; i < n; i++)
for ( j = i; j <= n; j++)
{
if ( i == j)
b[i][j] = a[i];
else
if ( a[j] < b[i][j-1])
b[i][j] = a[j];
else
b[i][j] = b[i][j-1];
}
i = 0;
while ( i < m)
{
fin >> x >> y;
fout << b[x][y] << '\n';
i++;
}
fin.close();
fout.close();
return 0;
}