Cod sursa(job #2455311)
| Utilizator | Data | 11 septembrie 2019 10:21:57 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[1001],dp[1001][40];
int n,m;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>v[i];
dp[i][0]=i;
}
for(int j=1;j<=(1<<n);j++)
{
for(int i=1;i<=n;i++)
if(i+(1<<j-1)<=n)
{
if(v[dp[i][j-1]]<v[dp[i+(1<<j-1)][j-1]])
dp[i][j]=dp[i][j-1];
else
dp[i][j]=dp[i+(1<<j-1)][j-1];
}
}
for(int i=1;i<=n;i++)
{
for(int j=0;j<=n;j++)
fout<<dp[i][j]<<' ';
fout<<'\n';
}
return 0;
}
