HDU
来源:互联网 发布:中国有嘻哈扒皮知乎 编辑:程序博客网 时间:2024/06/16 00:33
HDU - 2689You 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.嗯是逆序数也可以冒泡排序那个时候有想过逆序数但是不敢写一直都很弱加油呢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 31 2 34 4 3 2 1Sample Output 06#include<stdio.h>#define N 1000int main(){int n;while(scanf("%d",&n)!=EOF){int i,j,times=0;int a[N];for(i=0;i<n;i++)scanf("%d",&a[i]);for(i=0;i<n;i++)for(j=i+1;j<n;j++)if(a[i]>a[j]) times++;printf("%d\n",times);}return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- 微信小程序选择图片和预览图片
- STM32的USART发送数据时如何使用TXE和TC标志
- 一直想弄懂的地理坐标系与投影坐标系的区别
- c++整数和字符串转换
- Codeforces #839B: Game of the Row 题解
- HDU
- PreparedStatement 和statement的区别?
- servlet详解
- vector
- java转义符和正则表达式转义符
- 单双引号的区别,defined容易疏忽的小地方
- 数据库软删除
- 不用加号两数求和
- fileReader对象的事件先后顺序