codeforce 651B Beautiful Paintings

题意：后一个比前一个大就加一，问最大次数。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<string>
#include<cmath>
#include<vector>
using namespace std;
const int maxn=1e5+7;
const double eps=1e-8;
const double pi=acos(-1);
const int inf = 0x3f3f3f3f;
#define ll long long
#define clc(a,b) memset(a,b,sizeof(a))

int main()
{
    int n;
    scanf("%d",&n);
    int a[1010];
    clc(a,0);
    for(int i=0;i<n;i++)
    {
        int x;
        scanf("%d",&x);
        a[x]++;
    }
    int maxx=-inf;
    for(int i=0;i<=1000;i++)
    {
        if(maxx<a[i])
            maxx=a[i];
    }
    printf("%d
",n-maxx);
    return 0;
}