下定决心,好好过一天 ~
思路:直接模拟暴力即可,找到最小符合的数字,然后就直接分
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
vector<int> arr;
int len = arr.size(),num = 0,index = 0,vis[20] = {},Max = 0,flag = 0;
for(int i = 0; i < len;i++)
{
vis[arr[i]] = 1;
Max = max(Max,arr[i]);
if(arr[i] == index)
{
flag = 1;
}
if(flag)
{
int ans = 1;
for(int j = 0;j <= Max;j++)
if(!vis[j])
ans = 0;
if(ans)
{
index = Max+1;
flag = 0;
num++;
}
}
}
return num;
}