Lost Cows
N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers before dinner. When it was time to line up for their evening meal, they did not line up in the required ascending numerical order of their brands.
Regrettably, FJ does not have a way to sort them. Furthermore, he's not very good at observing problems. Instead of writing down each cow's brand, he determined a rather silly statistic: For each cow in line, he knows the number of cows that precede that cow in line that do, in fact, have smaller brands than that cow.
Given this data, tell FJ the exact ordering of the cows.
Input
* Line 1: A single integer, N
* Lines 2..N: These N-1 lines describe the number of cows that precede a given cow in line and have brands smaller than that cow. Of course, no cows precede the first cow in line, so she is not listed. Line 2 of the input describes the number of preceding cows whose brands are smaller than the cow in slot #2; line 3 describes the number of preceding cows whose brands are smaller than the cow in slot #3; and so on.
Output
* Lines 1..N: Each of the N lines of output tells the brand of a cow in line. Line #1 of the output tells the brand of the first cow in line; line 2 tells the brand of the second cow; and so on.
Sample Input
5 1 2 1 0
Sample Output
2 4 5 3 1
AC代码
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
stack <int> s1;
stack <int> s2;
int a[8001];
int main(){
int i,j,n,k;
cin>>n;
for(i=0;i<n-1;i++){
cin>>k;
s1.push(k);
a[i+1]=i+1;
}
a[n]=n;
while(!s1.empty()){
j=s1.top()+1;
s1.pop();
int tot=0;
for(i=1;;i++){
if(a[i]){
tot++;
}
if(tot==j) break;
}
s2.push(a[i]);
a[i]=0;
}
j=1;
while(!a[j]) j++;
s2.push(a[j]);
while(!s2.empty()){
cout<<s2.top()<<endl;
s2.pop();
}
return 0;
}
这道题的数据不是很大所以没用线段树也可以过。
“1210” “24531” 由“1210”得, 从最后着手,根据最后一个数‘0’’在最后一个位置(即第五个位置)是最小的那个数,然后把这个数标记为0。然后再根据倒数第二个数,找的倒数第二个(即第四个)位置对应的数。