nyoj--233--Sort it (水题)
2015-11-18 21:02
351 查看
Sort it
时间限制:1000 ms | 内存限制:65535 KB难度:2
描述 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
来源ZJFC 2009-3 Programming Contest上传者
张洁烽
好久以前没做出来的题,清理一下,的确是有点水
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; #define MAX 100100 int num[MAX]; int main() { int n; while(scanf("%d",&n)!=EOF) { for(int i=0;i<n;i++) scanf("%d",&num[i]); int sum=0; int t; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) { if(num[i]>num[j]) { t=num[i],num[i]=num[j],num[j]=t; sum++; } } } printf("%d\n",sum); } return 0; }
相关文章推荐
- ViewAnimator之ViewFlipper
- Ruby-Module初探
- block,inline和inline-block概念和区别大诠释
- UIToolbar
- 1、空间配置器
- GBDT(MART) 迭代决策树入门教程 | 简介
- ZigZag Conversion
- NYOJ 88:汉诺塔(一)【数学】
- CodeForces - 578B "Or" Game
- hibernate的一对多双向关联映射----客户和订单关系
- VirtualBox虚拟机网络设置(四种方式)
- 艺术品定制网站-开发服务器环境搭建のJDK
- Android中的各种单位
- 常见面试之机器学习算法思想简单梳理
- OCR / Vote disk Maintenance Operations: (ADD/REMOVE/REPLACE/MOVE) (Doc ID 428681.1)
- 07 java.awt.Robot的一些使用
- 最小圆覆盖(Smallest Enclosing Discs)
- 最大连续子序列
- langtaol的成长记
- 协方差的意义和计算公式(转)