【瞎搞】 HDU 5122 K.Bro Sorting

来源：互联网发布：java log日志输出编辑：程序博客网时间：2024/06/11 21:52

点击打开链接

思路：对于每一个数只要后面的数有比它小就要换

所以逆着计算下就可以了。。（同时记录最小值）

#include <cstdio>#include <cstring>#include <cstdlib>#include <string>#include <iostream>#include <algorithm>#include <sstream>#include <cmath>using namespace std;#include <queue>#include <stack>#include <set>#include <vector>#include <deque>#include <map>#define cler(arr, val)    memset(arr, val, sizeof(arr))#pragma comment(linker, "/STACK:102400000,102400000")typedef long long  LL;const int MAXN = 230+1;const int MAXM = 140000;const int INF = 0x3f3f3f3f;const int mod = 1000000007;int a[10000100];int main(){#ifndef ONLINE_JUDGE       freopen("in.txt", "r", stdin);   //  freopen("out.txt", "w", stdout);#endif    int t,n,cas=1;    cin>>t;    while(t--)    {        cin>>n;        for(int i=0;i<n;i++)            scanf("%d",&a[i]);        int maxx=999999999,sum=0;        for(int i=n-1;i>=0;i--)        {            if(maxx<a[i])                sum++;            else maxx=a[i];        }        printf("Case #%d: ",cas++);        cout<<sum<<endl;    }}

0 0