poj1703 Lost Cows

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 using namespace std;
 5 const int maxn = 8e3 + 10;
 6 int n;
 7 struct Point{
 8     int id, idx;
 9 }a[maxn];
10 
11 bool cmp(Point x, Point y) { return x.idx < y.idx; }
12 
13 int main(){
14     freopen("in.txt", "r", stdin);
15     while(~scanf("%d", &n)){
16         for(int i = 1; i <= n; i++) a[i].id = i;
17         a[1].idx = 1;
18         for(int i = 2, t; i <= n; i++){
19             scanf("%d", &t);
20             if(t + 1 == i) a[i].idx = i;
21             else{
22                 for(int j = i; j > t + 1; j--) a[j].idx = a[j - 1].idx;
23                 a[t + 1].idx = i;
24             }
25         }
26         sort(a + 1, a + n + 1, cmp);
27         for(int i = 1; i <= n; i++) printf("%d\n", a[i].id);
28     }
29     return 0;
30 }