K.Bro Sorting(杭电5122)(2014ACM/ICPC亚洲区北京站)
2014-11-29 22:51
381 查看
K.Bro Sorting
Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 67 Accepted Submission(s): 39
Problem Description
Matt’s friend K.Bro is an ACMer.
Yesterday, K.Bro learnt an algorithm: Bubble sort. Bubble sort will compare each pair of adjacent items and swap them if they are in the wrong order. The process repeats until no swap is needed.
Today, K.Bro comes up with a new algorithm and names it K.Bro Sorting.
There are many rounds in K.Bro Sorting. For each round, K.Bro chooses a number, and keeps swapping it with its next number while the next number is less than it. For example, if the sequence is “1 4 3 2 5”, and K.Bro chooses “4”, he will get “1 3 2 4 5” after
this round. K.Bro Sorting is similar to Bubble sort, but it’s a randomized algorithm because K.Bro will choose a random number at the beginning of each round. K.Bro wants to know that, for a given sequence, how many rounds are needed to sort this sequence
in the best situation. In other words, you should answer the minimal number of rounds needed to sort the sequence into ascending order. To simplify the problem, K.Bro promises that the sequence is a permutation of 1, 2, . . . , N .
Input
The first line contains only one integer T (T ≤ 200), which indicates the number of test cases. For each test case, the first line contains an integer N (1 ≤ N ≤ 106).
The second line contains N integers ai (1 ≤ ai ≤ N ), denoting the sequence K.Bro gives you.
The sum of N in all test cases would not exceed 3 × 106.
Output
For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1), y is the minimal number of rounds needed to sort the sequence.
Sample Input
2 5 5 4 3 2 1 5 5 1 2 3 4
Sample Output
Case #1: 4 Case #2: 1 HintIn the second sample, we choose “5” so that after the first round, sequence becomes “1 2 3 4 5”, and the algorithm completes.#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int a[1000010]; int main() { int i,n,T,kase=1,ans,cout; scanf("%d",&T); while(T--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); ans=a[n-1]; cout=0; for(i=n-2;i>=0;i--) { if(ans>a[i]) ans=a[i]; else cout++; } printf("Case #%d: %d\n",kase++,cout); } return 0; }
相关文章推荐
- HDU 5122 K.Bro Sorting && 2014ACM/ICPC亚洲区北京站
- hdu 5122 K.Bro Sorting 2014ACM/ICPC亚洲区北京站-重现赛
- 2014ACM/ICPC亚洲区北京站hdu5112~5122(dp,dfs)
- hdu 5122(2014ACM/ICPC亚洲区北京站) K题 K.Bro Sorting
- 2014ACM/ICPC亚洲区北京站-重现赛 K(hdu 5122)
- 2014ACM/ICPC亚洲区北京站现场赛(HDU 5111,5115,5119,5120,5122)
- HDU-5122-K.Bro Sorting (2014ACM/ICPC北京赛区现场赛K题!)
- A Curious Matt(杭电5112)(2014ACM/ICPC亚洲区北京站)
- HDU 5115 (2014ACM/ICPC亚洲区北京站) D题(Dire Wolf)
- hdu 5119 Happy Matt Friends 递推求解 2014ACM/ICPC亚洲区北京站
- HDU 5119 Happy Matt Friends 2014ACM/ICPC亚洲区北京站
- HDU5119Happy Matt Friends/2014ACM/ICPC亚洲区北京站regional3号题
- hdu 5119 Happy Matt Friends 2014ACM/ICPC亚洲区北京站-重现赛
- HDU 5514 Collision(扩展欧几里得+解方程)——2014ACM/ICPC亚洲区北京站
- 2014ACM/ICPC亚洲区北京站-A Curious Matt
- 【模拟】2014ACM/ICPC亚洲区北京站-A-(Curious Matt)
- 2014ACM/ICPC亚洲区北京站
- HDU - 5119 Happy Matt Friends dp 滚动数组 异或和 (2014ACM/ICPC亚洲区北京站-重现赛(感谢北师和上交)
- hdu 5115 Dire Wolf 2014ACM/ICPC亚洲区北京站-重现赛
- hdu 5122 K.Bro Sorting [ACM/ICPC 2014 北京站现场赛]