1017(二分+树状数组)
来源:互联网 发布:淘宝怎么用微信支付 编辑:程序博客网 时间:2024/06/05 19:42
Problem 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.
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 <br> <br>* 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. <br>
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
51210
Sample Output
24531
题目大概+思路:
二分和树状数组结合的题目。
代码:
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;int n;long long c[8005];int a[8005],b[8002];int vis[10000];int lowbit(int x){ return x&(-x);}void add(int x,int v){ while(x<=8001) { c[x]+=v; x=x+lowbit(x); }}long long sum(int x){ long long su=0; while(x>0) { su+=c[x]; x-=lowbit(x); } return su;}int go(int x){ int l=1,r=n; int mid; while(l<r) { mid=(l+r)/2; int ll=mid-sum(mid); if(ll<x) { l=mid+1; } else { r=mid; } } return l;}int main(){ scanf("%d",&n); for(int i=1;i<n;i++) { scanf("%d",&a[i]); } a[0]=0; for(int i=n-1;i>=0;i--) { b[i]=go(a[i]+1); add(b[i],1); } for(int i=0;i<n;i++) { printf("%d\n",b[i]); } return 0;}
阅读全文
0 0
- 1017(二分+树状数组)
- HDU 4339 Query(树状数组+二分)
- codeforces 191 E (树状数组+二分)
- hdu(4339)树状数组+二分查找
- Lost Cows(树状数组+二分)
- hdu 2852(树状数组+二分)
- POJ-2892(树状数组 + 二分)
- UVa 11525 Permutation(二分+树状数组)
- uva 11525排列(树状数组 + 二分)
- HDU 5493 Queue(二分+树状数组)
- UVA 11525 - Permutation(二分+树状数组)
- codeforces_652D. Nested Segments(树状数组、二分)
- HDU-4339 Query(树状数组+二分)
- HDU 5493 Queue(二分+树状数组)
- 区间交(树状数组+二分)hdu5700
- HDU 5493 Queue(树状数组+二分)
- poj2892 树状数组+二分
- poj2182(二分+树状数组)
- File类访问文件
- 新路程-----hi3516a遇到的编译警告
- HTTP 状态消息
- 总结今天的工作
- jquery.gridly.js
- 1017(二分+树状数组)
- 控制并发数量
- lintcode:将整数A转换为B
- 图像相关(二)
- javascript中的with
- 移动端Jenkins持续集成攻略(1)
- 前缀中的周期
- 求知过程之oracle初级积累一
- std::string::assign 崩溃的问题