其实是挺简单的题,找逆序数就可以,数据很小,暴力过;
-
逆序数(以下来自百度百科)
在一个排列中,如果一对数的前后位置与大小顺序相反,即前面的数大于后面的数,那么它们就称为一个
逆序。一个排列中逆序的总数就称为这个排列的
逆序数。一个排列中所有逆序总数叫做这个排列的逆序数。也就是说,对于n个不同的元素,先规定各元素之间有一个标准次序(例如n个 不同的自然数,可规定从小到大为标准次序),于是在这n个元素的任一排列中,当某两个元素的先后次序与标准次序不同时,就说有1个逆序。一个排列中所有逆序总数叫做这个排列的逆序数。
这道题也是这个意思;
Sort it
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4829 Accepted Submission(s): 3358
Problem Description
You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. Then how many times it need.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.
For example, 1 2 3 5 4, we only need one operation : swap 5 and 4.
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 <= 1000); the next line contains a permutation of the n integers from 1 to n.
Output
For each case, output the minimum times need to sort it in ascending order on a single line.
Sample Input
3 1 2 3 4 4 3 2 1
Sample Output
0 6代码;#include <stdio.h> #include <string.h> #include <stdlib.h> #include <iostream> #include <algorithm> #include <math.h> #define MAX 50000+5 using namespace std; int main(){ int N; while((scanf("%d",&N))!=EOF){ int a[1005]; int i, j; for(i=0; i<N; i++) scanf("%d",&a[i]); int cnt=0; for(i=0; i<N; i++) for(j=i+1; j<N; j++) if(a[i]>a[j]) cnt++; printf("%d\n",cnt); } return 0; }