CodeForcesGym 100735G LCS Revised

LCS Revised

Time Limit: 2000ms

Memory Limit: 65536KB

This problem will be judged on CodeForcesGym. Original ID: 100735G
64-bit integer IO format: %I64d      Java class name: (Any)

 

The longest common subsequence is a well known DP problem: given two strings A and B, one has to compute the maximum length of a subsequence that's common to both A and B.

In this particular problem we work with strings A and B formed only by 0 and 1, having the same length. You're given a string A of length n. Iterate all strings B possible. There are 2n of them. Calculate, for each string B, the longest common subsequence of A and B. Then, output the minimum length obtained.

 

Input

The first and the only line of the input contains string A, formed only by 0 and 1. It's guaranteed that the length is between 1 and 105.

 

Output

Output a single number - the requested length.

 

Sample Input

Input

101010

Output

3

Source

KTU Programming Camp (Day 1)

 

解题：坑爹题

 #include <bits/stdc++.h>
 using namespace std;
 const int maxn = ;
 char str[maxn];
 int main() {
     while(~scanf("%s",str)) {
         int one = ,zero = ;
         for(int i = ; str[i]; ++i)
             if(str[i] == '') zero++;
             else one++;
         printf("%d\n",min(zero,one));
     }
     return ;
 }