HDU : Permutation Recovery


// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <sstream>
#include <set>
#include <math.h>
#define pi acos(-1.0)
#define N 1000000
using namespace std;


int main ()
{
    int n;

    while ( scanf ("%d", &n) && n ) {
        int permute [500 + 10];
        memset (permute, -1, 510 * sizeof(int));

        for ( int i = 1; i <= n; i++ ) {
            int greaterNumber;
            scanf ("%d", &greaterNumber);
            int index = -1;
            while ( greaterNumber != -1 ) {
                index++;
                if ( permute [index] > i || permute [index] == -1 )
                    greaterNumber--;
            }
            permute [index] = i;
        }

        printf ("%d", permute [0]);
        for ( int i = 1; i < n; i++ )
            printf (",%d", permute [i]);
        printf ("\n");
    }

    return 0;
}

// @END_OF_SOURCE_CODE

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s