Cod sursa(job #1254786)
| Utilizator | Data | 3 noiembrie 2014 15:01:24 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m,k,i,arbore[1000],v[1000];
void prima_umplere(int st,int dr,int r)
{
if(st==dr)
{
arbore[r]=v[k];
k++;
}
else
{
int mij=(st+dr)/2;
prima_umplere(st,mij,r*2);
prima_umplere(mij+1,dr,r*2+1);
arbore[r]=arbore[r*2]+arbore[r*2+1];
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
k=1;
prima_umplere(1,n,1);
for(i=1;i<=n*2+1;i++)
fout<<arbore[i]<<" ";
return 0;
}
