hdu 2689 Sort it
来源:互联网 发布:手机淘宝登录在哪里 编辑:程序博客网 时间:2024/05/01 07:01
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.
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
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.
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 <iostream>#include <string>#include <cstring>#include <algorithm>#include <iomanip>using namespace std;int main(){int m,n,i,j,k,p,q,a[1005];while(cin>>n){for(i=0;i<n;i++) cin>>a[i]; k=0; for(i=0;i<n-1;i++) for(j=i+1;j<n;j++) if(a[i]>a[j]) { swap(a[i],a[j]); k++; } cout<<k<<endl;}return 0;}
0 0
- hdu 2689 Sort it
- hdu 2689 Sort it
- HDU 2689 Sort it
- HDU-2689-Sort it
- hdu 2689 Sort it
- Sort it hdu 2689
- HDU 2689 Sort it
- hdu 2689 Sort it
- HDU-2689-Sort it
- hdu 2689 Sort it
- hdu 2689 sort it
- 【HDU 2689】【水题】Sort it
- 杭电ACM HDU 2689 Sort it
- HDU 2689 sort it - from lanshui_Yang
- hdu 2689 Sort it(线段树)
- HDU 2689 Sort it (树状数组)
- HDU 2689 Sort it [树状数组]【数据结构】
- hdu 2689 Sort it(树状数组)
- Android.mk 编写规则简介
- CSS3:nth-child()伪类选择器,奇偶数行自定义样式first-child
- java技巧--提高代码运行效率
- 数据库之字符串处理SQL语句
- JAVA 泛型详解一
- hdu 2689 Sort it
- iOS开发 免证书真机调试
- BBS热点事件探测
- ACE_Event_Handler
- iOS CGContextRef详解
- 【论文笔记】Beyond frontal faces: improving person recognition using multiple cues
- 导入百度SDK教程
- JAVA 泛型详解二
- python编码问题之——Decode error - output not utf-8