• 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

     
    解题:坑爹题
     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 const int maxn = 100010;
     4 char str[maxn];
     5 int main() {
     6     while(~scanf("%s",str)) {
     7         int one = 0,zero = 0;
     8         for(int i = 0; str[i]; ++i)
     9             if(str[i] == '0') zero++;
    10             else one++;
    11         printf("%d
    ",min(zero,one));
    12     }
    13     return 0;
    14 }
    View Code
  • 相关阅读:
    倍增_ST表与LCA
    树状数组
    CF1365B 题解
    左偏树
    ES5_04_Array扩展
    ES5_03_Object扩展
    ES5_05_Function扩展
    前台样式与实际开发应用
    利用Mircosoft URLRewriter.dll实现页面伪静态(伪静态系列一)
    递归算法常见习题代码(控制台程序)
  • 原文地址:https://www.cnblogs.com/crackpotisback/p/4812497.html
Copyright © 2020-2023  润新知