Pagini recente » Cod sursa (job #873305) | Cod sursa (job #2894886) | Cod sursa (job #2282309) | Cod sursa (job #3198375) | Cod sursa (job #1074268)
#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
const int n_max=100001;
int n, m, i, x, p, v, vmax[n_max];
int max(int a, int b)
{
if(a>b) return a;
return b;
}
void push(int nod, int st, int dr)
{
int m;
if(st==dr)
{
vmax[nod]=x;
return;
}
m=(st+dr)/2;
if(p<=m) push(2*nod, st, m);
else push(2*nod+1, m+1, dr);
vmax[nod]=max(vmax[2*nod], vmax[2*nod+1]);
}
int main()
{
cin>>n>>m;
for(i=1; i<=n; i++)
{
cin>>x;
p=i;
v=x;
push(1, 1, n);
}
for(i=1; i<=n*n; i++) cout<<vmax[i]<<" ";
return 0;
}