POJ.2182.Lost Cows 非递归线段树 0ms

此编程挑战涉及解决牛的排序问题。给定每头牛前面有多少品牌较小的牛的信息,任务是确定牛的正确排序。使用了一种特殊的数据结构来高效地处理这个问题。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Lost Cows

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 10681 Accepted: 6852

Description
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

Source
USACO 2003 U S Open Orange

// Source Code
// Problem: 2182        User: BlackKitty
// Memory: 320K     Time: 0MS
// Language: C++        Result: Accepted

#include <stdio.h>
#include <stdlib.h>
#define M 8001
int s[M] = { 1 }, t[M<<2];

void bd(int l, int r, int v){
//建树
    t[1] = r;
    r <<= 2;
    for (int i = 2; i <= r; i++){
        t[i] = (t[i >> 1] >> 1) + ((t[i >> 1] & 1) && (~i & 1));
    }
}

int qy(int k, int l, int r, int v){
//查询并删除元素
    int m;
    for (;;){
        m = (l + r) >> 1;
        if (l == r)
            return r;
        if (k > t[v << 1]){
            t[v << 1 | 1]--;
            k -= t[v << 1];
            l = m + 1;
            v = v << 1 | 1;
        }
        else{
            t[v << 1]--;
            r = m;
            v = v << 1;
        }
    }
}


int main(){
    int i,j,n;
    scanf("%d", &n);
    bd(1, n, 1);
    for (i = 1; i < n;i++){
        scanf("%d", s + i); 
        s[i]++;
    }
    for (i = n - 1; i >= 0; i--)
        s[i] = qy(s[i], 1, n, 1);
    for (i = 0; i < n;printf("%d\n", s[i++]));

    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值