hdu 3015 Disharmony Trees (离散化+树状数组)
Disharmony Trees
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 663 Accepted Submission(s): 307
She finds that trees maybe disharmony and the Disharmony Value between two trees is associated with two value called FAR and SHORT.
The FAR is defined as the following:If we rank all these trees according to their X Coordinates in ascending order.The tree with smallest X Coordinate is ranked 1th.The trees with the same X Coordinates are ranked the same. For example,if there are 5 tree with X Coordinates 3,3,1,3,4. Then their ranks may be 2,2,1,2,5. The FAR of two trees with X Coordinate ranks D1 and D2 is defined as F = abs(D1-D2).
The SHORT is defined similar to the FAR. If we rank all these trees according to their heights in ascending order,the tree with shortest height is ranked 1th.The trees with the same heights are ranked the same. For example, if there are 5 tree with heights 4,1,9,7,4. Then their ranks may be 2,1,5,4,2. The SHORT of two trees with height ranks H1 and H2 is defined as S=min(H1,H2).
Two tree’s Disharmony Value is defined as F*S. So from the definition above we can see that, if two trees’s FAR is larger , the Disharmony Value is bigger. And the Disharmony value is also associated with the shorter one of the two trees.
Now give you every tree’s X Coordinate and their height , Please tell Sophia the sum of every two trees’s Disharmony value among all trees.
For each test case, the first line contain one integer N (2 <= N <= 100,000) N represents the number of trees.
Then following N lines, each line contain two integers : X, H (0 < X,H <=1,000,000,000 ), indicating the tree is located in Coordinates X and its height is H.
//203MS 4548K 1948 B C++
/*
题意:
给出n个树的位置和高度,求每两棵数的位置排名差绝对值与高度排名较小的的积的和。 离散化+树状数组:
不错的一道题,我卡在结果的计算,的确对树状数组计算的能力的理解不够!
用两个排序排出位置和高度的排名,然后再对高度排名在进行计算,计算公式:
ans+=p[i].hid*(cnt*p[i].xid-sum+tsum-sum-(i-cnt-1)*p[i].xid); //每个高度
算法时间复杂度为O(n*lgn) */
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define N 100005
struct node{
int x,h;
int xid,hid;
int id;
}p[N],p1[N],p2[N];
__int64 cnum[N],clen[N];
int cmpx(const void *a,const void*b)
{
return (*(node*)a).x-(*(node*)b).x;
}
int cmph(const void*a,const void*b)
{
return (*(node*)a).h-(*(node*)b).h;
}
int cmp0(const void*a,const void*b)
{
return (*(node*)b).hid-(*(node*)a).hid;
}
int lowbit(int k)
{
return (-k)&k;
}
void update(__int64 c[],int k,int detal)
{
for(;k<N;k+=lowbit(k))
c[k]+=detal;
}
__int64 getsum(__int64 c[],int k)
{
__int64 s=;
for(;k>;k-=lowbit(k))
s+=c[k];
return s;
}
int main(void)
{
int n,x,h;
while(scanf("%d",&n)!=EOF)
{
memset(cnum,,sizeof(cnum));
memset(clen,,sizeof(clen));
for(int i=;i<=n;i++){
scanf("%d%d",&p[i].x,&p[i].h);
p[i].id=i;
p1[i]=p2[i]=p[i];
}
qsort(p1+,n,sizeof(p1[]),cmpx);
for(int i=,j=;i<=n;i++){
if(i> && p1[i].x!=p1[i-].x) j=i;
p[p1[i].id].xid=j;
}
qsort(p2+,n,sizeof(p2[]),cmph);
for(int i=,j=;i<=n;i++){
if(i> && p2[i].h!=p2[i-].h) j=i;
p[p2[i].id].hid=j;
}
qsort(p+,n,sizeof(p[]),cmp0);
__int64 ans=;
//for(int i=1;i<=n;i++) printf("*%d %d\n",p[i].hid,p[i].xid);
update(cnum,p[].xid,);
update(clen,p[].xid,p[].xid);
for(int i=;i<=n;i++){
__int64 cnt=getsum(cnum,p[i].xid);
__int64 sum=getsum(clen,p[i].xid);
__int64 tsum=getsum(clen,N-);
ans+=p[i].hid*(cnt*p[i].xid-sum+tsum-sum-(i-cnt-)*p[i].xid);
update(cnum,p[i].xid,);
update(clen,p[i].xid,p[i].xid);
}
printf("%I64d\n",ans);
}
return ;
}
hdu 3015 Disharmony Trees (离散化+树状数组)的更多相关文章
- HDU 3015 Disharmony Trees(树状数组)
题意:给你n棵树,每棵树上有两个权值X H 对于X离散化 :3 7 1 5 3 6 -> 2 6 1 4 2 5,对于H一样 然后F = abs(X1-X2) S=min(H1,H2) 求出 ...
- HDU 3015 Disharmony Trees 【 树状数组 】
题意:给出n棵树,给出横坐标x,还有它们的高度h,先按照横坐标排序,则它们的横坐标记为xx, 再按照它们的高度排序,记为hh 两颗树的差异度为 abs(xx[i] - xx[j]) * min(hh[ ...
- HDU 5862 Counting Intersections(离散化+树状数组)
HDU 5862 Counting Intersections(离散化+树状数组) 题目链接http://acm.split.hdu.edu.cn/showproblem.php?pid=5862 D ...
- HDU 6318.Swaps and Inversions-求逆序对-线段树 or 归并排序 or 离散化+树状数组 (2018 Multi-University Training Contest 2 1010)
6318.Swaps and Inversions 这个题就是找逆序对,然后逆序对数*min(x,y)就可以了. 官方题解:注意到逆序对=交换相邻需要交换的次数,那么输出 逆序对个数 即可. 求逆序对 ...
- CodeForces 540E - Infinite Inversions(离散化+树状数组)
花了近5个小时,改的乱七八糟,终于A了. 一个无限数列,1,2,3,4,...,n....,给n个数对<i,j>把数列的i,j两个元素做交换.求交换后数列的逆序对数. 很容易想到离散化+树 ...
- HDOJ/HDU 1556 Color the ball(树状数组)
Problem Description N个气球排成一排,从左到右依次编号为1,2,3-.N.每次给定2个整数a b(a <= b),lele便为骑上他的"小飞鸽"牌电动车从 ...
- Ultra-QuickSort(归并排序+离散化树状数组)
Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 50517 Accepted: 18534 ...
- hdu 5517 Triple(二维树状数组)
Triple Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Sub ...
- BZOJ_4627_[BeiJing2016]回转寿司_离散化+树状数组
BZOJ_4627_[BeiJing2016]回转寿司_离散化+树状数组 Description 酷爱日料的小Z经常光顾学校东门外的回转寿司店.在这里,一盘盘寿司通过传送带依次呈现在小Z眼前.不同的寿 ...
随机推荐
- C#调用c++类的导出函数
C# 需要调用C++东西,但是有不想做成COM,就只好先导出类中的函数处理. 不能直接调用,需单独导出函数 参考:http://blog.csdn.net/cartzhang/article/deta ...
- 北京Uber优步司机奖励政策(12月16日)
滴快车单单2.5倍,注册地址:http://www.udache.com/ 如何注册Uber司机(全国版最新最详细注册流程)/月入2万/不用抢单:http://www.cnblogs.com/mfry ...
- golang 仿python pack/unpack
写得不完善也不完美 尤其是高低位转换那(go和c 二进制高地位相反 需要转换,还有go int转[]byte长度是4位),希望牛人看后指导一下 项目需要通过socket调取 客户端是go ,服务器端是 ...
- 2019年猪年海报PSD模板-第五部分
14套精美猪年海报,免费猪年海报,下载地址:百度网盘,https://pan.baidu.com/s/1CuZKPmFbbSBvzSXoCt2few
- 「日常训练」Kefa and Company(Codeforces Round #321 Div. 2 B)
题意与分析(CodeForces 580B) \(n\)个人,告诉你\(n\)个人的工资,每个人还有一个权值.现在从这n个人中选出m个人,使得他们的权值之和最大,但是对于选中的人而言,其他被选中的人的 ...
- hdu1848Fibonacci again and again(sg函数)
Fibonacci again and again Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Jav ...
- [译] JavaScript核心指南(JavaScript Core) 【转】
本文转自:http://remember2015.info/blog/?p=141#scope-chain 零.索引 对象(An Object) 原型链(A Prototype Chain) 构造函数 ...
- Python数据分析实战-Boston Public Schools GEO数据分析-Part1
项目目标: Boston Public Schools Geo数据是来自于Boston地区的公共学校的数据,具体描述了学校的坐标,名字,类型等.基于此数据,我们可以学习一些基本的Python数据分析的 ...
- 使用truffle测试部署合约
truffle console let contract; contract=BloggerCoin.deployed().then(instance=>contract=instanc e);
- java一些面试题
java虚拟机 什么时候会触发full gc System.gc()方法的调用 老年代空间不足 永生区空间不足(JVM规范中运行时数据区域中的方法区,在HotSpot虚拟机中又被习惯称为永生代或者永生 ...