Cod sursa(job #1023370)
Utilizator | Data | 6 noiembrie 2013 20:58:14 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream cin("invsc.in");
ofstream cout("invsc.out");
int n, v[200001], x[200001], i, k;
int main()
{
cin>>n;
for(i=1; i<=n; i++)
{
cin>>v[i];
x[v[i]]++;
}
for(i=2; x[i]; i++) x[i]+=x[i-1];
for(i=1; i<=n; i++)
{
k=v[i];
v[i]=x[k];
x[k]--;
}
for(i=1; i<=n; i++) cout<<v[i]<<'\n';
return 0;
}