zoukankan      html  css  js  c++  java
  • 线段树求逆序对

    题目链接 hdu-5775

    P is a permutation of the integers from 1 to N(index starting from 1). 
    Here is the code of Bubble Sort in C++. 

    for(int i=1;i<=N;++i)
    for(int j=N,t;j>i;—j)
    if(P[j-1] > P[j])
    t=P[j],P[j]=P[j-1],P[j-1]=t;

    After the sort, the array is in increasing order. ?? wants to know the absolute values of difference of rightmost place and leftmost place for every number it reached.

    InputThe first line of the input gives the number of test cases T; T test cases follow. 
    Each consists of one line with one integer N, followed by another line with a permutation of the integers from 1 to N, inclusive. 

    limits 
    T <= 20 
    1 <= N <= 100000 
    N is larger than 10000 in only one case. 
    OutputFor each test case output “Case #x: y1 y2 … yN” (without quotes), where x is the test case number (starting from 1), and yi is the difference of rightmost place and leftmost place of number i.Sample Input

    2
    3
    3 1 2
    3
    1 2 3

    Sample Output

    Case #1: 1 1 2
    Case #2: 0 0 0

    Hint

    In first case, (3, 1, 2) -> (3, 1, 2) -> (1, 3, 2) -> (1, 2, 3)
    the leftmost place and rightmost place of 1 is 1 and 2, 2 is 2 and 3, 3 is 1 and 3
    In second case, the array has already in increasing order. So the answer of every number is 0.
     1 #include<stdio.h>
     2 #include<iostream>
     3 #include<algorithm>
     4 #include<string.h>
     5 #include<vector>
     6 #include<cmath>
     7 #include<string>
     8 #include<map>
     9 #include<queue>
    10 using namespace std;
    11 typedef long long ll;
    12 ll c[100001],n,l[100001],r[100001],d[100001];
    13 struct node{
    14     ll id,val,index;
    15     bool operator<(const node &th)const
    16     {
    17         return val<th.val; 
    18     }
    19 }num[100001];
    20 ll lowbit(ll x){
    21     return x&(-x);
    22 }
    23 void update(ll pos){
    24     while(pos<=n){
    25         c[pos]++;
    26         pos+=lowbit(pos);
    27     }
    28 }
    29 ll getsum(ll pos){
    30     ll sum=0;
    31     while(pos>0){
    32         sum+=c[pos];
    33         pos-=lowbit(pos);
    34     }
    35     return sum;
    36 }
    37 
    38 int main(){
    39     ll t,cnt=1;
    40     scanf("%lld",&t);
    41     while(t--){
    42         scanf("%lld",&n);
    43         memset(c,0,sizeof(c));
    44         for(ll i=1;i<=n;i++){
    45             scanf("%lld",&num[i].val);
    46             //cin>>num[i].val;
    47 //            d[i]=num[i]
    48             l[num[i].val]=min(i,num[i].val);//最左边的位置
    49             num[i].id=n-i+1;//方便查看num[i].val后面比他小的个数
    50             num[i].index=i;
    51         }
    52         sort(num+1,num+1+n);
    53         for(ll i=1;i<=n;i++){
    54             ll mp=getsum(num[i].id);
    55             d[num[i].val]=num[i].index+mp-l[num[i].val];
    56             update(num[i].id);
    57         }
    58         printf("Case #%lld:",cnt++);
    59         for(ll i=1;i<=n;i++){
    60             printf(" %lld",d[i]);
    61         }
    62         printf("
    ");
    63     }
    64     return 0;
    65 }
  • 相关阅读:
    Jmeter4.0压测实战
    tomcat只部署一个index.html 文件
    redis 查看当前连接数
    公众号入口-H5测试要点
    windows 下启动redis && Python 操作 redis
    Jmeter4.0之beanshell引用外部jar
    算法练习之存在重复元素
    python 递归查找jpg文件并打印
    hadoop单节点安装
    windows 下获取文件夹下的文件名称
  • 原文地址:https://www.cnblogs.com/akpower/p/11325671.html
Copyright © 2011-2022 走看看