hdu 5122 K.Bro Sorting(思维+冒泡思想)
来源:互联网 发布:医学数据可视化ppt 编辑:程序博客网 时间:2024/06/05 01:00
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 .
The second line contains N integers a i (1 ≤ a i ≤ N ), denoting the sequence K.Bro gives you.
The sum of N in all test cases would not exceed 3 × 10 6.
255 4 3 2 155 1 2 3 4
Case #1: 4Case #2: 1
In the second sample, we choose “5” so that after the first round, sequence becomes “1 2 3 4 5”, and the algorithm completes.
#include <iostream>#include <stdio.h>#include <stdlib.h>#include <string.h>#include <algorithm>#include <math.h>using namespace std;int a[3000050];int main(){ int n,t; scanf("%d",&t); for(int cas=1;cas<=t;cas++) { scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); long long ans=0; int maxn=a[n-1]; for(int i=n-1;i>=0;i--) { if(a[i]>maxn)ans++; if(a[i]<maxn)maxn=a[i]; } printf("Case #%d: %lld\n",cas,ans); } return 0;}
阅读全文
0 0
- hdu 5122 K.Bro Sorting(思维+冒泡思想)
- HDU 5122 K.Bro Sorting (14北京 思维模拟)
- 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
- HDU 5122 K.Bro Sorting
- K.Bro Sorting HDU
- 【瞎搞】 HDU 5122 K.Bro Sorting
- python3 字符串方法
- 基本css,网站开发问题
- void及void指针含义的深刻解析
- 数据结构之——稀疏矩阵
- 2017年6月26日
- hdu 5122 K.Bro Sorting(思维+冒泡思想)
- Java中String和byte[]转换(包括十六进制转换)
- 轮盘抽奖
- nginx 1.4.6 设置上传大小 client_max_body_size
- Spring的注解@Qualifier小总结
- 彻底删除Oracle 11g的方法
- HybridDB for MySQL 实现在线与离线数据分离的实践
- 【脚本语言系列】关于Python结构化二进制文件处理HDF5,你需要知道的事
- R语言:如何声明函数