Submission #1698678

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; ++i)
#define FOR(i,n,m) for(long long i=n; i<m; ++i)
#define DUMP(n,a) for(long long dump=0; dump<n; ++dump) { cout<<a[dump]; if(dump!=n-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	string t;
	cin>>t;
	ll ret=0;
	ll buf=0;
	REP(i,t.size()) {
		if(i%2==0&&(t[i]=='2'||t[i]=='?')) buf++;
		else if(i%2==1&&(t[i]=='5'||t[i]=='?')&&buf>0) buf++;
		else {
			ret=max(ret,buf-(int)(buf%2==1));
			buf=0;
		}
	}
	ret=max(ret,buf-(int)(buf%2==1));
	buf=0;
	REP(i,t.size()) {
		if(i%2==1&&(t[i]=='2'||t[i]=='?')) buf++;
		else if(i%2==0&&(t[i]=='5'||t[i]=='?')&&buf>0) buf++;
		else {
			ret=max(ret,buf-(int)(buf%2==1));
			buf=0;
		}
	}
	ret=max(ret,buf-(int)(buf%2==1));
	buf=0;
	cout<<ret<<endl;
}

Submission Info

Judge Result