Cod sursa(job #1191412)
Utilizator | Data | 27 mai 2014 15:47:13 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream ka("rmq.in");
ofstream ki("rmq.out");
int b[100005][17], v[100005], n, m, x, y;
int main()
{
ka >> n >> m;
for(int i = 1; i <= n; i++)
ka >> b[i][0];
for(int i = 2; i <= n; i++)
v[i] = 1 + v[i>>1];
}