南阳oj 233 sort it
2016-09-10 16:38
246 查看
描述
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.
输入
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.
输出
For each case, output the minimum times need to sort it in ascending order on a single line.
样例输入
样例输出
以下附上代码
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.
输入
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.
输出
For each case, output the minimum times need to sort it in ascending order on a single line.
样例输入
3 1 2 3 4 4 3 2 1
样例输出
0 6
以下附上代码
#include<stdio.h> #include <algorithm> #include <iostream> #include <string.h> #include <math.h> using namespace std; int a[1002]; int main() { int t,n,i,j; while(~scanf("%d",&n)&&n) { int t,i,j,m=0; for(i=0; i<n; i++) cin>>a[i]; for(i=0; i<n; i++) for(j=i+1; j<n; j++) if(a[i]>a[j]) { t=a[i]; a[i]=a[j]; a[j]=t; m++; } cout<<m<<endl; } return 0; }
相关文章推荐
- Sort it (南阳理工oj-233)
- NYOJ233 Sort it
- NYOJ233 Sort it
- nyoj-233-Sort it
- NYOJ 233 Sort it
- NYOJ 233 Sort it
- 233 Sort it【模拟】
- NYOJ 233 Sort it
- 【南阳 oj】 8--一种排序(sort排序)
- nyoj--233--Sort it (水题)
- nyoj--233--Sort it (水题)
- nyist 233 Sort it
- 括号匹配--STL--栈的使用--南阳OJ
- 树状数组入门基础题 南阳oj 116
- 南阳 oj 语言入门 笨小熊
- C小加 之 随机数(南阳oj255)(水题)
- 无主之地1(南阳oj845)
- 南阳OJ 题目75:日期计算
- NYOJ 233 &&NYOJ 322 Sort(树状数组)
- Toplogical sort(pku 1094 Sorting It All Out)