poj2481 树状数组
来源:互联网 发布:vb表格控制使用 编辑:程序博客网 时间:2024/05/21 17:49
/**对所有牛按先左端点s从小到大排序,如果s相等则按e从大到小排序 **/
/**这样遍历的时候只需要满足某个点在该点左边就可以了 **/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
const int maxn = 100000 + 7;
struct node
{
int x, y, id;
bool operator<(const node& rhs) const {
if(rhs.y == y) return x < rhs.x;
return y > rhs.y;
}
}str[maxn];
int ans[maxn];
int cnt[maxn];
int n;
inline int lowbit(int x)
{
return x & (-x);
}
inline int GetSum(int x)
{
int sum = 0;
while(x > 0) {
sum += cnt[x];
x -= lowbit(x);
}
return sum;
}
inline void update(int x)
{
while(x <= n) {
cnt[x] += 1;
x += lowbit(x);
}
}
int main()
{
while(scanf("%d", &n) != EOF && n) {
for(int i = 0; i < n; ++i) {
scanf("%d%d", &str[i].x, &str[i].y);
++str[i].x, ++str[i].y;
str[i].id = i;
}
sort(str, str + n);
for(int i = 0; i < n; ++i) {
if(i != 0 && str[i].x == str[i-1].x && str[i].y == str[i-1].y)
ans[ str[i].id ] = ans[str[i-1].id];
else ans[ str[i].id ] = GetSum(str[i].x);
update(str[i].x);
}
for(int i = 0; i < n; ++i) {
if(i == 0) printf("%d", ans[i]);
else printf(" %d", ans[i]);
}
printf("\n");
}
return 0;
}
/**这样遍历的时候只需要满足某个点在该点左边就可以了 **/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
const int maxn = 100000 + 7;
struct node
{
int x, y, id;
bool operator<(const node& rhs) const {
if(rhs.y == y) return x < rhs.x;
return y > rhs.y;
}
}str[maxn];
int ans[maxn];
int cnt[maxn];
int n;
inline int lowbit(int x)
{
return x & (-x);
}
inline int GetSum(int x)
{
int sum = 0;
while(x > 0) {
sum += cnt[x];
x -= lowbit(x);
}
return sum;
}
inline void update(int x)
{
while(x <= n) {
cnt[x] += 1;
x += lowbit(x);
}
}
int main()
{
while(scanf("%d", &n) != EOF && n) {
for(int i = 0; i < n; ++i) {
scanf("%d%d", &str[i].x, &str[i].y);
++str[i].x, ++str[i].y;
str[i].id = i;
}
sort(str, str + n);
for(int i = 0; i < n; ++i) {
if(i != 0 && str[i].x == str[i-1].x && str[i].y == str[i-1].y)
ans[ str[i].id ] = ans[str[i-1].id];
else ans[ str[i].id ] = GetSum(str[i].x);
update(str[i].x);
}
for(int i = 0; i < n; ++i) {
if(i == 0) printf("%d", ans[i]);
else printf(" %d", ans[i]);
}
printf("\n");
}
return 0;
}
0 0
- poj2481-树状数组
- POJ2481树状数组
- poj2481 树状数组
- poj2481~Cows~(树状数组)
- POJ2481:Cows(树状数组)
- poj2481 树状数组
- poj2481 树状数组
- POJ2481 Cows 树状数组
- poj2481 Cows (树状数组)
- POJ2481->树状数组
- poj2481树状数组
- [树状数组]poj2481 Cows
- 树状数组poj2481
- [POJ2481] cows - 树状数组
- POJ2481 Cows 树状数组
- POJ2481 树状数组+sort
- poj2481-树状数组的应用
- poj2481之排序+树状数组
- 解决centos7中yum安装包时遇到python版本不一致问题
- 机房收费系统文档
- android 通过eclipse混淆代码 打包 + proguard 总结
- hashmap测试key的hashcoode相同的效果
- no class
- poj2481 树状数组
- NSURL / NSURLComponents
- Listview 插入記錄前判斷textbox 值是否為空,如是取消保存
- 安卓应用主题和样式
- IOS 将json转换成mode工具
- CF 591B Rebranding
- java clone()
- redis集群实战
- HTTPClient