pojAGTC(LCS,DP)
来源:互联网 发布:js 精确两位小数 编辑:程序博客网 时间:2024/06/06 09:56
题目链接:
啊哈哈,点我点我
题意:给两个字符串,找出经过多少个操作可以使得两个串相等。。
思路:找出两个串的最长公共子序列,然后用最大的串的长度减去最长公共子序列的长度得到的就是需要的操作数。。
题目:
AGTCTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10015 Accepted: 3849
Description
Let x and y be two strings over some finite alphabet A. We would like to transform x into y allowing only operations given below:
- Deletion: a letter in x is missing in y at a corresponding position.
- Insertion: a letter in y is missing in x at a corresponding position.
- Change: letters at corresponding positions are distinct
Certainly, we would like to minimize the number of all possible operations.
IllustrationA G T A A G T * A G G C| | | | | | |A G T * C * T G A C G CDeletion: * in the bottom line
Insertion: * in the top line
Change: when the letters at the top and bottom are distinct
This tells us that to transform x = AGTCTGACGC into y = AGTAAGTAGGC we would be required to perform 5 operations (2 changes, 2 deletions and 1 insertion). If we want to minimize the number operations, we should do it like
A G T A A G T A G G C| | | | | | |A G T C T G * A C G C
and 4 moves would be required (3 changes and 1 deletion).
In this problem we would always consider strings x and y to be fixed, such that the number of letters in x is m and the number of letters in y is n where n ≥ m.
Assign 1 as the cost of an operation performed. Otherwise, assign 0 if there is no operation performed.
Write a program that would minimize the number of possible operations to transform any string x into a string y.
Input
The input consists of the strings x and y prefixed by their respective lengths, which are within 1000.
Output
An integer representing the minimum number of possible operations to transform any string x into a string y.
Sample Input
10 AGTCTGACGC11 AGTAAGTAGGC
Sample Output
4
Source
代码为:
#include<cstring>#include<cstdio>#include<algorithm>#include<iostream>using namespace std;const int maxn=1000+10;int dp[maxn][maxn];char str1[maxn],str2[maxn];int LCS(int len1,int len2){ memset(dp,0,sizeof(dp)); for(int i=1;i<=len1;i++) for(int j=1;j<=len2;j++) { if(str1[i-1]==str2[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } return dp[len1][len2];}int main(){ int n,m; while(~scanf("%d%s",&n,str1)) { scanf("%d%s",&m,str2); int len1=strlen(str1); int len2=strlen(str2); int ans=LCS(len1,len2); int max_ans=max(n,m); printf("%d\n",max_ans-ans); } return 0;}
- pojAGTC(LCS,DP)
- lcs(dp)
- hdu5791 Two(DP,LCS)
- POJ1159---Palindrome(dp,LCS)
- DP:LCS
- LCS-DP
- DP--LCS
- uva10066 - The Twin Towers(dp,lcs)
- POJ 1458 Common Subsequence (DP,LCS)
- 【解题报告】uva10192_Vacation(假期, dp, LCS)
- HDU 1503 Advanced Fruits (LCS,DP)
- poj 1458 Common Subsequence (DP:LCS)
- HDU 1159 Common Subsequence(dp LCS)
- POJ 1159-Palindrome(DP/LCS变形)
- Uva 111-History Grading(DP/LCS)
- poj 2250 Compromise(裸LCS DP)
- LightOJ 1013 - Love Calculator (LCS + dp)
- HDU 1087 lcs变形 (简单DP)
- 洛瑞大帆布包从巴宝莉
- android使用C/C++调用SO库
- 母函数
- poj 1426 Find The Multiple(bfs)
- GDB查看内存指令引用操作的示例
- pojAGTC(LCS,DP)
- Message Flood
- Ios 程序打包,安装流程
- 妈妈买了香水,她曾经爱过
- iOS设备中per app vpn,到底需要哪些系统要求?
- 买香奈儿鞋在这个夏天
- Linux驱动学习——并发和竞态
- MySQL添加服务、设置密码、修改密码
- hadoop 2.2.0伪分布式安装