zoukankan      html  css  js  c++  java
  • UVa 10739 String to Palindrome 字符串dp

    Problem H
    String to Palindrome

    Input: Standard Input

    Output: Standard Output

    Time Limit: 1 Second

    In this problem you are asked to convert a string into a palindrome with minimum number of operations. The operations are described below:

    Here you’d have the ultimate freedom. You are allowed to:

    • Add any character at any position
    • Remove any character from any position
    • Replace any character at any position with another character

    Every operation you do on the string would count for a unit cost. You’d have to keep that as low as possible.

    For example, to convert “abccda” you would need at least two operations if we allowed you only to add characters. But when you have the option to replace any character you can do it with only one operation. We hope you’d be able to use this feature to your advantage.

    Input

    The input file contains several test cases. The first line of the input gives you the number of test cases, T (1≤T≤10). Then T test cases will follow, each in one line. The input for each test case consists of a string containing lower case letters only. You can safely assume that the length of this string will not exceed 1000 characters.

    Output

    For each set of input print the test case number first. Then print the minimum number of characters needed to turn the given string into a palindrome.

    Sample Input                               Output for Sample Input

    6
    tanbirahmed
    shahriarmanzoor
    monirulhasan
    syedmonowarhossain
    sadrulhabibchowdhury
    mohammadsajjadhossain

    Case 1: 5

    Case 2: 7

    Case 3: 6

    Case 4: 8

    Case 5: 8

    Case 6: 8


    --------------------

    LCS的变形

    f[i,j]=f[i+1,j-1];(j-l<1)

    f[i,j]=min(f[i+1][j-1],f[i+1][j],f[i][j-1]+1;

    -------------------

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    
    using namespace std;
    
    const int OO=1e9;
    
    int f[1111][1111];
    char s[1111];
    
    int dfs(int l,int r)
    {
        int ret;
        if (r-l<1) return 0;
        if (f[l][r]!=-1) return f[l][r];
        if (s[l]==s[r])
        {
            ret=dfs(l+1,r-1);
        }
        else
        {
            ret=min( dfs(l+1,r), min( dfs(l,r-1), dfs(l+1,r-1) ) )+1;
        }
        f[l][r]=ret;
        return ret;
    }
    
    int main()
    {
        int T;
    
        scanf("%d",&T);
        for (int cnt=1;cnt<=T;cnt++)
        {
            memset(f,-1,sizeof(f));
            scanf("%s",s+1);
            printf("Case %d: %d\n",cnt,dfs(1,strlen(s+1)));
        }
        return 0;
    }
    








  • 相关阅读:
    《The One!》团队作业4:基于原型的团队项目需求调研与分析
    《TheOne团队》团队作业三:团队项目原型设计与开发
    《The One 团队》第二次作业:团队项目选题
    《The One!团队》第一次作业:团队亮相
    实验十 团队作业6:团队项目系统设计改进与详细设计
    易校园——项目系统设计与数据库设计
    易校园--项目需求分析
    软工实践——团队上机作业
    团队编程第一次作业
    《发际线总是和我作队》第六次作业:团队项目系统设计改进与详细设计
  • 原文地址:https://www.cnblogs.com/cyendra/p/3226395.html
Copyright © 2011-2022 走看看