Educational Codeforces Round 63 (Rated for Div. 2) B. Game with Telephone Numbers 博弈思维+模拟+贪心思维

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 typedef long long ll;
 4 const int maxn=3e5+5;
 5 char s[maxn];
 6 int main(){
 7     int n;
 8     scanf("%d",&n);
 9     scanf("%s",s+1);
10     int cnt=0;
11     int huihe=n-11;
12     for(int i=1;i<=n;i++){
13         if(s[i]=='8')cnt++;
14     }
15     int flag=0;
16     int i;
17     for( i=1;i<=n;i++){
18         if(s[i]=='8')flag++;
19         if(flag==huihe/2+1)break;
20     }
21     if(cnt<=huihe/2){
22         cout<<"NO\n";
23     }
24     else {
25         if((i-1-huihe/2)<=huihe/2)cout<<"YES\n";
26         else cout<<"NO\n";
27     }
28     return 0;
29 }