HDOJ 1394 Minimum Inversion Number 求循环串的最小逆序数(暴力&&线段树)
来源:互联网 发布:php源码站 编辑:程序博客网 时间:2024/06/05 16:30
Minimum Inversion Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14879 Accepted Submission(s): 9082
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
ac代码:
暴力解法:425ms
#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#define INF 0x7fffffff#define MAXN 10010#define max(a,b) a>b?a:b#define min(a,b) a>b?b:ausing namespace std;int num[MAXN];int main(){int i,j,n;while(scanf("%d",&n)!=EOF){int M;int cnt=0;for(i=0;i<n;i++)scanf("%d",&num[i]);for(i=0;i<n;i++){for(j=i+1;j<n;j++){if(num[j]<num[i])cnt++;}}M=cnt;for(i=0;i<n;i++){cnt=cnt-num[i]+n-1-num[i];if(M>cnt)M=cnt;}printf("%d\n",M);}return 0;}看到很多人都用线段树来写,我也想写一下,明天吧!
0 0
- HDOJ 1394 Minimum Inversion Number 求循环串的最小逆序数(暴力&&线段树)
- 【线段树-区间求和求最小逆序数】HDOJ Minimum Inversion Number 1394
- HDU 1394 Minimum Inversion Number(循环数组求逆序数)(暴力,归并排序,线段树)
- HDOJ 1394 Minimum Inversion Number(逆序数 + 线段树)
- HDOJ 1394 Minimum Inversion Number(线段树+逆序数)
- HDOJ 1394 Minimum Inversion Number(求逆序数—暴力or线段树or树状数组:单点更新,区间求和)
- HDU 1394 Minimum Inversion Number(线段树求最小逆序数对)
- HDU 1394 Minimum Inversion Number(线段树求最小逆序数对)
- hdu 1394 Minimum Inversion Number(最小逆序数) 线段树/暴力
- hdoj 1394 Minimum Inversion Number【线段树求逆序对】
- HDU 1394 Minimum Inversion Number (线段树+最小逆序数)
- HDU 1394 Minimum Inversion Number 最小逆序数 线段树
- HDU 1394 Minimum Inversion Number 线段树求逆序数
- hdu 1394 Minimum Inversion Number 线段树求逆序数
- 线段树求逆序数 hdu 1394 Minimum Inversion Number
- HDU 1394 Minimum Inversion Number【线段树求逆序数】
- HDU 1394- Minimum Inversion Number(线段树求逆序数)
- HDU 1394 Minimum Inversion Number // 线段树求逆序数
- Kafka史上最详细原理总结
- Android项目开发实战:2D翻转
- 给定n个不同的整数,问这些数中有多少对整数,它们的值正好相差1(ccf真题)
- java 8 JVM性能优化
- 二叉树操作Java
- HDOJ 1394 Minimum Inversion Number 求循环串的最小逆序数(暴力&&线段树)
- uva 1373 - How I Wonder What You Are!(几何)
- 面试中的算法和编程准备(董飞授课记录)
- 人人网用户信息爬虫
- 并查集判断树
- 3D GAME PROGRAMMING WITH DIRECTX11 (1)
- 大数据——海量数据处理的基本方法总结
- Java多线程之线程分类【案例分析】
- UE4学习之关卡设计入门