hdu2838 cow sorting
来源:互联网 发布:sql多表删除 编辑:程序博客网 时间:2024/06/08 18:37
Problem Description
Sherlock's N (1 ≤ N ≤ 100,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the range 1...100,000. Since grumpy cows are more likely to damage Sherlock's milking equipment, Sherlock would like to reorder the cows in line so they are lined up in increasing order of grumpiness. During this process, the places of any two cows (necessarily adjacent) can be interchanged. Since grumpy cows are harder to move, it takes Sherlock a total of X + Y units of time to exchange two cows whose grumpiness levels are X and Y.
Please help Sherlock calculate the minimal time required to reorder the cows.
Please help Sherlock calculate the minimal time required to reorder the cows.
Input
Line 1: A single integer: N
Lines 2..N + 1: Each line contains a single integer: line i + 1 describes the grumpiness of cow i.
Lines 2..N + 1: Each line contains a single integer: line i + 1 describes the grumpiness of cow i.
Output
Line 1: A single line with the minimal time required to reorder the cows in increasing order of grumpiness.
Sample Input
3231
Sample Output
7跟sort it一类的 凡是交换相邻数达到按顺序排列都是求逆序数 所以这次是(X+Y)这次要带上数值了 所以建了结构体树状数组 一个记录这个数字有没有出现过 另一个记录前多少项的值。#include <iostream>#include<string.h>#include<stdio.h>using namespace std;const int maxn=100005;int n;struct cow{ int num; long long sum;}a[maxn];int lowbit(int i){ return i&(-i);}void update(int i, int x, int y){ while(i<=n) { a[i].num+=y; a[i].sum+=x; i=i+lowbit(i); }}long long query_num(int i) { long long ans=0; while(i>0) { ans+=a[i].num; i-=lowbit(i); } return ans;}long long query_sum(int i){ long long ans=0; while(i>0) { ans+=a[i].sum; i-=lowbit(i); } return ans;}int main(){ int x; while(cin>>n) { long long ans=0; memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) { scanf("%d",&x); update(x,x,1); long long k1=i-query_num(x); //i位置之前比x大的数有多少 if(k1!=0) { long long k2=query_sum(n)-query_sum(x); //所有前n个数的和减去比a小的数的和 因为 a是刚输入的 前n-1个数都是在她之前插入的 所以如果比她大就应该交换 ans+=k1*x+k2; } } cout<<ans<<endl; } return 0;}
0 0
- hdu2838 Cow Sorting
- hdu2838 cow sorting
- hdu2838——Cow Sorting
- 树状数组 hdu2838 Cow Sorting
- HDU2838 Cow Sorting 树状数组
- hdu2838 Cow Sorting(树状数组)
- hdu2838 Cow Sorting 树状数组
- HDU2838 Cow Sorting (树状数组)
- HDU2838 Cow Sorting (逆序数+求和)
- HDU2838 Cow Sorting【树状数组】【逆序数】
- HDU2838 Cow Sorting 树状数组 区间求和加逆序数的应用
- cow sorting
- Cow Sorting
- hdu2838
- hdu2838
- pku3270 Cow Sorting
- poj 3270 Cow Sorting
- POJ Cow Sorting 置换
- RFID天线数据传输原理:负载调制
- OpenGLES的简单应用绘图,以及照相机画面变色变形渲染(七)
- HTTP协议简要
- 轮流拿(取)东西问题
- 苹果个人开发证书提交appStore细节
- hdu2838 cow sorting
- thinkphp upload上传显示不存在文件解决
- Hadoop学习三(java api 对hdfs常用操作)
- PowerDesigner生成sql语句时自动导出注释
- C++四种强制类型转换运算符
- Struts2学习笔记(第四天)
- Netty 网络IO BIO
- 浏览器事件Event.deepPath属性
- js 检测浏览器是否联网 (navigator.onLine)