#include #define rep(i,a,b) for(int i=a;i=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() //#pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b leftest; leftest[0] = -1; int ans = 0, sm = 0; rep(R, 0, N) { sm += A[R]; if (leftest.count(-sm)) { chmax(ans, R - leftest[-sm]); } else { leftest[sm] = R; } } cout << ans << endl; } //--------------------------------------------------------------------------------------------------- void _main() { cin >> S; N = S.length(); if (N <= 100) solve1(); else if (N <= 1000) solve2(); else solve3(); }