36. inversion sequence

 

▣ 입력예제 

 

8

5 3 4 0 2 1 1 0

 

 

▣ 출력예제 

 

4 8 6 2 5 1 3 7

 

 

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>

using namespace std;

int main()
{
	int n, pos;
	cin >> n;

	vector<int> is(n+1), os(n+1);

	for (int i = 1; i <= n; ++i)
	{
		cin >> is[i];
	}

	for (int i = n; i >= 1; --i)
	{
		pos = i; // 8 7 6 5 4 3 2 1

		for (int j = 1; j <= is[i]; ++j)
		{
			os[pos] = os[pos + 1];
			pos++;
		}
		os[pos] = i;
	}

	for (int i = 1; i <= n; ++i)
	{
		cout << os[i] << " ";
	}
}