Pagini recente » Cod sursa (job #798605) | Profil SheepBOY | Cod sursa (job #1944571) | Cod sursa (job #2852924) | Cod sursa (job #3183897)
#include <bits/stdc++.h>
using namespace std;
/**
8
a = 1 1 3 4 4 2 1 3
cls = 7 6 3
cls[i]=j : j a iesit al i-lea in clasament
1 2 3 4 5 6 7 8
aib = 0 1 0 1 1 1 1 1
7 2 8 6 1 3 5 4
*/
ifstream fin("schi.in");
ofstream fout("schi.out");
int aib[100003], n, a[100003], cls[100003];
void Update(int p, int y)
{
while (p <= n)
{
aib[p] += y;
p += (p & (-p));
}
}
int Query(int p)
{
int suma = 0;
while (p > 0)
{
suma += aib[p];
p -= (p & (-p));
}
return suma;
}
/// cauta binar cea mai din stanga pozitie p
/// in care a[1]+...+a[p] = x
/// daca p nu exista returnam -1
/// O(log^2 n)
int CautBin(int x)
{
int st, dr, mij, p, suma;
st = 1; dr = n; p = -1;
while (st <= dr)
{
mij = (st + dr) / 2;
suma = Query(mij);
if (suma == x)
{
p = mij;
dr = mij - 1;
}
else if (suma < x) st = mij + 1;
else dr = mij - 1;
}
return p;
}
int main()
{
int i, p;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> a[i];
Update(i, 1);
}
for (i = n; i >= 1; i--)
{
p = CautBin(a[i]);
cls[p] = i;
Update(p, -1);
}
for (i = 1; i <= n; i++)
fout << cls[i] << "\n";
return 0;
}