hdu5122（水题）

最新推荐文章于 2020-09-28 11:45:23 发布

Water_Wood_

最新推荐文章于 2020-09-28 11:45:23 发布

阅读量327

点赞数

分类专栏：水

本文链接：https://blog.csdn.net/Water_Wood_/article/details/50983288

版权

水专栏收录该内容

1 篇文章 0 订阅

订阅专栏

K.Bro Sorting

Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 1891 Accepted Submission(s): 871

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 ≤ 10 ⁶).

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 ⁶.

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

Sample Output

  
  
   
   Case #1: 4
Case #2: 1

  
  
  
  
   
   训练线段树的时候学长加进去的，，然而线性查找只有O（n），，，就没写线段树。。
  
  
  
  
   
   水了一发，就是从后面扫描一下数组，，要换的时候换一下，记录值然后就ok。
  
  
  
  
   
   #include<iostream>
#include<stdio.h>
#include<iostream>
using namespace std;
int a[1000000+10];
int main()
{
    int T,n,j=1;
    scanf("%d",&T);
    while(T--)
    {

        scanf("%d",&n);
        for(int i=0; i<n; i++)
        {
            scanf("%d",&a[i]);

        }
        int m=a[n-1];
        int ans=0;
        for(int i=n-2;i>=0;i--)
        {
            if(a[i]>m) ans++;
            else m=a[i];
        }
        printf("Case #%d: %d\n",j++,ans);

    }
}