hdu1394 Minimum Inversion Number 最小逆序数 线段树单点更新区间查询
来源:互联网 发布:淘宝联盟登陆要认证 编辑:程序博客网 时间:2024/05/01 03:36
Minimum Inversion Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16198 Accepted Submission(s): 9852
Problem Description
The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.
For a given sequence of numbers a1, a2, ..., an, if we move the first m >= 0 numbers to the end of the seqence, we will obtain another sequence. There are totally n such sequences as the following:
a1, a2, ..., an-1, an (where m = 0 - the initial seqence)
a2, a3, ..., an, a1 (where m = 1)
a3, a4, ..., an, a1, a2 (where m = 2)
...
an, a1, a2, ..., an-1 (where m = n-1)
You are asked to write a program to find the minimum inversion number out of the above sequences.
For a given sequence of numbers a1, a2, ..., an, if we move the first m >= 0 numbers to the end of the seqence, we will obtain another sequence. There are totally n such sequences as the following:
a1, a2, ..., an-1, an (where m = 0 - the initial seqence)
a2, a3, ..., an, a1 (where m = 1)
a3, a4, ..., an, a1, a2 (where m = 2)
...
an, a1, a2, ..., an-1 (where m = n-1)
You are asked to write a program to find the minimum inversion number out of the above sequences.
Input
The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 5000); the next line contains a permutation of the n integers from 0 to n-1.
Output
For each case, output the minimum inversion number on a single line.
Sample Input
101 3 6 9 0 8 5 7 4 2
Sample Output
16
Author
CHEN, Gaoli
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#define lson l, m, rt << 1#define rson m + 1, r, rt << 1 | 1using namespace std;const int maxn = 5555;int sum[maxn << 2];int a[5555];void PushUp(int rt) {sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];}void build(int l, int r, int rt) {if (l == r) {sum[rt] = 0;return;}int m = (l + r) >> 1;build(lson);build(rson);PushUp(rt);}int query(int L, int R, int l, int r, int rt) {if (L <= l && r <= R) {return sum[rt];}int m = (l + r) >> 1;if (R <= m)return query(L, R, lson);else if (L > m)return query(L, R, rson);else if (L <= m && R > m)return query(L, m, lson) + query(m + 1, R, rson);}//等价query另类写法/*int query(int L, int R, int l, int r, int rt) {if (L <= l && r <= R) {return sum[rt];}int m = (l + r) >> 1;int res = 0;if (L <= m) res += query(L, R, lson);if (R > m) res += query(L, R, rson);return res;}*/void update(int p, int l, int r, int rt) {if (l == r) {sum[rt]++;return;}int m = (l + r) >> 1;if (p <= m)update(p, lson);elseupdate(p, rson);PushUp(rt);}int main(){int N;while (~scanf("%d", &N)) {build(0, N - 1, 1);int ans = 0;for (int i = 0; i < N; i++) {scanf("%d", &a[i]);//查询>a[i]的之前输过的数有几个,就是这个数的逆序数ans += query(a[i], N - 1, 0, N - 1, 1);//将这个数记录下来,供后面的数计算逆序数update(a[i], 0, N - 1, 1);}int minn = ans;/*将a[i]移到最后面会减少a[i]个逆序,增加N - 1 - a[i]个逆序例如:3 6 9 0 8 5 7 4 2 1-->6 9 0 8 5 7 4 2 1 3原因是3使得0 1 2的逆序共减少了3,但是由于4 5 6 7 8 9使自己的逆序增加了10 - 1 - 3 = 6*/for (int i = 0; i < N - 1; i++) {ans += (N - 1 - a[i] - a[i]);minn = min(ans, minn);}printf("%d\n", minn);}return 0;}
0 0
- hdu1394 Minimum Inversion Number 最小逆序数 线段树单点更新区间查询
- HDU1394 Minimum Inversion Number 逆序数- 线段树单点更新求
- HDU1394 Minimum Inversion Number(线段树单点更新,暴力,逆序数)
- Minimum Inversion Number(线段树单点更新+逆序数)
- hdu1394 Minimum Inversion Number(最小逆序数)
- HDU1394 Minimum Inversion Number [暴力] [线段树-单点更新]
- HDU1394:Minimum Inversion Number(线段树单点更新)
- hdu1394 Minimum Inversion Number 线段树,单点更新
- hdu1394 Minimum Inversion Number(线段树单点更新||暴力)
- HDU1394-Minimum Inversion Number(线段树单点更新)
- 数据结构 线段树 hdu1394 Minimum Inversion Number(单点更新)
- HDU1394 Minimum Inversion Number(线段树单点更新)
- HDU1394 Minimum Inversion Number 【线段树】+【逆序数】
- 【线段树求逆序数】【HDU1394】Minimum Inversion Number
- hdu1394 Minimum Inversion Number 线段树求逆序数
- hdu1394 -Minimum Inversion Number(线段树求逆序数)
- HDOJ 1394 Minimum Inversion Number(求逆序数—暴力or线段树or树状数组:单点更新,区间求和)
- [HDU]1394 Minimum Inversion Number (树状数组--单点更新,区间查询 求逆序数)
- 回归与分类的区别
- 管理achive log
- HDU 2028 Lowest Common Multiple Plus(求多个数的最小公倍数,转换呀)
- 第三次c++作业
- Mybatis第一天
- hdu1394 Minimum Inversion Number 最小逆序数 线段树单点更新区间查询
- nyoj168
- 全排列问题
- c# .net2 httphelper
- Android WebView的Js对象注入漏洞解决方案
- Qt通过样式表一键换皮肤 风格
- js
- android 抽取BaseFragment
- Poj 2385 Apple Catching【dp】