题面

80分代码求调:

#include<iostream>
using namespace std;
long long a[20000005],f[20000005];
int main(){
	string s;
	cin>>s;
	int len=s.size();
	for(int i=0;i<len;i++){
		a[i+1]=s[i]-'0';
		f[i+1]=-1;
	}
	for(int i=1;i<=len;i++){
		if(a[i]<a[i-1]){
			if(f[i-1]==i-1){
				cout<<"no";
				return 0;
			}else{
				a[i]=1;
				f[i]=i;
			}
		}	
	}
	cout<<"yes";
	return 0;
}