Cod sursa(job #2480512)
| Utilizator | Data | 25 octombrie 2019 18:25:04 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int r[17][100001],log[100001];
int main()
{
int n,m,x,y;
in>>n>>m;
for(int =1; i<=n; i++) in>>r[0][i]
log[1]=0;
for(int i=2; i<=17; i++)
{
log[i]=1+log[i/2];
}
for(int i=1; i<=17; i++)
{
for(int j=1; j<=n; j++)
{
r[i][j]=min(r[i-1][j], r[i-1][j+1<<log[i-1]]);
}
}
for(int i=1; i<=17; i++)
{
for(int j=1; j<=n; j++)
{
out<<r[i][j]<<" ";
}
out<<"\n";
}
/*for(int k=1; k<=m; k++)
{
in>>m;
}*/
return 0;
}
