HDOJ 5122 K.Bro Sorting 水题
来源:互联网 发布:美橙互联数据库主机名 编辑:程序博客网 时间:2024/06/03 13:09
K.Bro Sorting
Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 71 Accepted Submission(s): 40
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 .
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.
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
255 4 3 2 155 1 2 3 4
Sample Output
Case #1: 4Case #2: 1HintIn the second sample, we choose “5” so that after the first round, sequence becomes “1 2 3 4 5”, and the algorithm completes.
Source
2014ACM/ICPC亚洲区北京站-重现赛(感谢北师和上交)
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int T_T;int n;int a[1000100];int tree[1000100];int lowbit(int x){ return x&(-x);}int add(int p){ for(int i=p;i<=n;i+=lowbit(i)) tree[i]+=1;}int sum(int p){ int sum=0; for(int i=p;i;i-=lowbit(i)) sum+=tree[i]; return sum;}int main(){ int cas=1; scanf("%d",&T_T); while(T_T--) { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",a+i); memset(tree,0,sizeof(tree)); int ans=0; for(int i=1;i<=n;i++) { int rm=sum(a[i]-1); int bigger=i-1-rm; if(i-bigger!=a[i]) { ans++; } add(a[i]); } printf("Case #%d: %d\n",cas++,ans); } return 0;}
0 0
- HDOJ 5122 K.Bro Sorting 水题
- hdu 5122 K.Bro Sorting
- hdu 5122 K.Bro Sorting
- HDU 5122 K.Bro Sorting
- hdu 5122 K.Bro Sorting
- HDU-5122-K.Bro Sorting
- HDU 5122 K.Bro Sorting
- HDU 5122 K.Bro Sorting
- HDU 5122 K.Bro Sorting
- HDU 5122 K.Bro Sorting
- HDU 5122 K.Bro Sorting
- HDU 5122 K.Bro Sorting
- HDU 5122 K.Bro Sorting
- 【瞎搞】 HDU 5122 K.Bro Sorting
- 杭电5122 K.Bro Sorting
- HDU-5122 K.Bro Sorting(贪心)
- HDU 5122 K.Bro Sorting (贪心)
- HDU - 5122 K.Bro Sorting(贪心)
- unity3d 带缓冲的镜头拉近效果
- android打开、查看文件
- Red5学习笔记(二)连接通信
- 用Java开源项目JOONE实现人工智能编程
- strust2初识及示例
- HDOJ 5122 K.Bro Sorting 水题
- 如何让登陆后直接转跳到首页而不是管理中心解决办法
- I/O 输入输出
- 邻接表的深度优先搜索(DFS)
- nginx正则笔记
- win7下Eclipse4.4.0+JDK1.8配置hadoop2.5.1插件遇到的各种错误
- HDOJ 5112 A Curious Matt 水题
- Linux命令行(console)屏幕分辨率调整
- Struts2中的Action