C. Lose it!

You are given an array a consisting of n integers. Each ai is one of the six following numbers: 4,8,15,16,23,42.

Your task is to remove the minimum number of elements to make this array good.

An array of length k is called good if k is divisible by 6 and it is possible to split it into k6 subsequences 4,8,15,16,23,42.

Examples of good arrays:

[4,8,15,16,23,42] (the whole array is a required sequence);
[4,8,4,15,16,8,23,15,16,42,23,42] (the first sequence is formed from first, second, fourth, fifth, seventh and tenth elements and the second one is formed from remaining elements);
[] (the empty array is good).
Examples of bad arrays:

[4,8,15,16,42,23] (the order of elements should be exactly 4,8,15,16,23,42);
[4,8,15,16,23,42,4] (the length of the array is not divisible by 6);
[4,8,15,16,23,42,4,8,15,16,23,23] (the first sequence can be formed from first six elements but the remaining array cannot form the required sequence)

题意：题目把 [4,8,15,16,23,42] 定义为一个好的子序列，然后给你一个数组，你可以对数组进行无数次操作（删除一个元素），

问你最少操作多少次，可以将该数组变成好的序列（只要保证序列里的每个 [4,8,15,16,23,42] 序列的顺序就行了，相互之间可以交叉）

可以先找有多少个这样的子序列，最后n-子序列的个数*6就可以了

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxx = 5e5+10;
int a[maxx];

int main()
{
    int n;
    while(cin>>n)
    {
        int i;
        for(i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }
        int count = 0;
        int s1,s2,s3,s4,s5,s6;;
        s1 = s2 = s3 = s4 = s5 = s6 = 0; 
        for(i=0; i<n; i++)
        {
            if(a[i]==4)
                s1++;
            else if(a[i]==8&&s1>s2)    //只有4出现的个数大于8出现的个数时s2才能++
                s2++;
            else if(a[i]==15&&s2>s3)  
                s3++;
            else if(a[i]==16&&s3>s4)
                s4++;
            else if(a[i]==23&&s4>s5)
                s5++;
            else if(a[i]==42&&s5>s6)
                s6++;
            if(s1&&s2&&s3&&s4&&s5&&s6)
            {
                s1--;
                s2--;
                s3--;
                s4--;
                s5--;
                s6--;
                count++;
            }
        }
        printf("%d\n",n-count*6);
    }
    return 0;
}