#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 (a < b) { a = b; return 1; } return 0; } templatebool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } //--------------------------------------------------------------------------------------------------- /*---------------------------------------------------------------------------------------------------             ∧_∧       ∧_∧  (´<_` )  Welcome to My Coding Space!      ( ´_ゝ`) /  ⌒i @hamayanhamayan     /   \    | |     /   / ̄ ̄ ̄ ̄/  |   __(__ニつ/  _/ .| .|____      \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ string N; int M; int dp[201010][2]; //--------------------------------------------------------------------------------------------------- void _main() { cin >> N; M = N.length(); reverse(all(N)); rep(i, 0, M + 1) rep(hasKuri, 0, 2) dp[i][hasKuri] = inf; dp[0][0] = 0; rep(i, 0, M) rep(hasKuri, 0, 2) { int x = N[i] - '0' + hasKuri; if(x == 0) { chmin(dp[i + 1][0], dp[i][hasKuri]); } else if(x == 1) { chmin(dp[i + 1][0], dp[i][hasKuri] + 1); chmin(dp[i + 1][1], dp[i][hasKuri] + 1); } else { chmin(dp[i + 1][1], dp[i][hasKuri]); } } //rep(i, 0, M + 1) rep(k, 0, 2) printf("dp[%d][%d] = %d\n", i, k, dp[i][k]); int ans = chmin(dp[M][0], dp[M][1] + 1); cout << ans << endl; }