18.10.15 POJ 2182 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.
输入

* 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.
输出

* 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.

样例输入

5
1
2
1
0

样例输出

2
4
5
3
1

来源

USACO 2003 U S Open Orange

#include <iostream>
#include <string.h>
#include <algorithm>
#include <stack>
#include <string>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <fstream>

using namespace std;

const int maxn = 8005;
int cow[maxn],n,brand[maxn];
struct node {
    int l, r;
    int sum;
}tree[maxn*4];

void build(int root, int l, int r) {
    tree[root].l = l, tree[root].r = r;
    tree[root].sum = r - l + 1;
    if (l != r) {
        build(2 * root, l,(l+r)/2);
        build(2 * root + 1, (l + r) / 2 + 1, r);
    }
}

void init() {
    scanf("%d", &n);
    build(1, 1, n);
    for (int i = 2; i <= n; i++)
        scanf("%d", &cow[i]);
}

int query(int root,int num) {
    tree[root].sum--;
    if (tree[root].l == tree[root].r)return tree[root].l;
    if (tree[root * 2].sum >= num)return query(root * 2, num);
    return query(root * 2 + 1, num-tree[root*2].sum);
}

int main()
{
    init();
    for (int i = n; i >= 1; i--)
        brand[i] = query(1, cow[i]+1);
    for (int i = 1; i <= n; i++)
        printf("%d
", brand[i]);
    return 0;
}

今天真是离奇地困……

本来以为sssx没睡着的

做到题才发现，果然是睡着了