Pagini recente » Cod sursa (job #1832878) | Cod sursa (job #1914014) | Cod sursa (job #1205398) | Cod sursa (job #1622720) | Cod sursa (job #2485179)
#include<fstream>
using namespace std;
ifstream fin("huffman.in");
ofstream fout("huffman.out");
struct huff{long long cod;long long w;int nr;int st;int dr;} v[2000001];
int n,i,x,a,b,k,p1,p2;
long long sol;
int next_el()
{
int a=-1,b=-1,ca=0,cb=0;
if(p2<k) b=p2;
if(p1<=n) a=p1;
if(a==-1) cb=1;
else if(b==-1) ca=1;
else if(v[a].w>v[b].w) cb=1; else ca=1;
if(ca==1)
{
p1++;
return a;
}
p2++;
return b;
}
void solve(int nod,int nivel)
{
v[nod].nr=nivel;
long long aux=v[nod].cod;
if(v[nod].st!=0)
{
sol+=v[nod].w;
v[v[nod].st].cod=aux*2,v[v[nod].dr].cod=aux*2+1;
solve(v[nod].st,nivel+1);
solve(v[nod].dr,nivel+1);
}
}
int main()
{
fin>>n;
for(i=1;i<=n;i++){
fin>>x;
v[i].w=x;
}
p1=1;p2=n+1;
for(k=n+1;;k++)
{
a=next_el();b=next_el();
v[k].w=v[a].w+v[b].w;
v[k].st=a;v[k].dr=b;
if(p1==n+1&&p2==k) break;
}
solve(k,0);
fout<<sol<<"\n";
for(i=1;i<=n;i++) fout<<v[i].nr<<" "<<v[i].cod<<"\n";
return 0;
}