HEU 5001 Inversion

 1/**//**************************************
 2Problem: HEU 5001 Inversion
 3Time: 0.0000 s
 4Memory: 240 k 
 5Accepted Time: 2009-03-28 12:57:21
 6Tips: 数字排列 
 7**************************************/
 8#include <stdio.h>
 9#include <string.h>
int main()
{
    int n;
    while(1)
    {
        scanf("%d",&n);
        if(n==0)break;
        char ch[5];
        int i,j,a[60],b[60];
        scanf("%s",ch);
        for(i=0;i<n;i++)scanf("%d",&a[i]);
        if(ch[0]=='P')
        {    
            for(i=0;i<n;i++)
            {
                int count=0;
                for(j=0;;j++)
                {
                    if(a[j]>i+1)count++;
                    else if(a[j]==i+1)break;
                }
                b[i]=count;
            }
        }
        else
        {
            bool c[60];
            memset(c,1,sizeof(c));
            for(i=0;i<n;i++)
            {
                j=0;
                int count=0;
                while(j!=a[i])
                {
                    if(c[count++])j++;
                }
                while(!c[count])count++;
                b[count]=i+1;
                c[count]=0;
            }
        }
        for(i=0;i<n-1;i++)printf("%d ",b[i]);
        printf("%d\n",b[i]);
    }
    return 0;
}