Submission #1695737

---

Source Code Expand

#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) (r).begin(),(r).end()
#define rall(r) (r).rbegin(),(r).rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int f(string s) {
    int ret = 0;
    int cnt = 0;
    REP(i, 1, s.size()) {
        if(s[i-1] == '2' && s[i] == '5') cnt += 2, ++i;
        else cnt = 0;
        ret = max(ret, cnt);
    }
    return ret;
}

int calc(string t) {
    string s;
    for(auto& c : t) {
        if(c == '?') s += (s.size()&1 ? '5' : '2');
        else s += c;
    }
    return f(s);
}

int main(){
#ifdef LOCAL_TEST
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    string s;
    cin >> s;
    cout << max(calc(s), calc(s.substr(1))) << endl;
    return 0;
}

Submission Info

Judge Result