hdu 2689

【hdu 2689】的更多相关文章

hdu 2689 超级大水题....两种代码都过了,开始以为n^2会tle,后来竟然过了...汗注意下cin写在while里面,就可以了 #include <iostream> using namespace std; int main() { int n,i,j,a[1010]; while(cin>>n) { for(i=1; i<=n; i++) cin>>a[i]; int cnt = 0; for(i=1; i<=n; i++) for(j=i+…

HDU 2689 Sort it (树状数组)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2689 Sort it 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 …

hdu 2689 Sort it

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2689 题目分析:求至少交换多少次可排好序,可转换为逆序对问题. 用冒泡排序较为简单,复杂度较大~~ 也可用归并排序,复杂度O(lognn), 统计个数后复杂都不变. /* Sort it Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2660…

HDU 2689 Sort it【树状数组】

Sort it Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4672 Accepted Submission(s): 3244 Problem Description You want to processe a sequence of n distinct integers by swapping two adjacent s…

HDU 2689 sort it - from lanshui_Yang

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 : s…

HDU 2689.Sort it-冒泡排序

Sort it Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4679 Accepted Submission(s): 3250 Problem Description You want to processe a sequence of n distinct integers by swapping two adjacent s…

HDU - 2689 Sort it与2016蓝桥杯B 交换瓶子排序（相邻交换与任意交换）

Sort it 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.…