38번 inversion sequence알고리즘

#include<iostream>
#include<vector>
using namespace std;

int main(void)
{
	int N=0;
	int temp = 0;
	int cnt = 0;
	cin >> N;
	vector<int> arr(N);
	vector<int> result(N);
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i];
		result[i] = 0;
	}
	cnt = N;
	for (int i = N-1; i >= 0; i--)
	{
		result[i] = cnt;


		for (int j = i; j < i+arr[i]; j++)
		{
			temp = result[j];
			result[j] = result[j + 1];
			result[j + 1] = temp;
		}

		cnt--;
	}

	for (int i = 0; i < N; i++)
	{
		cout << result[i] << " ";
	}

}