(简单dp) poj 3356 AGTC
来源:互联网 发布:mm巧克力网络电视广告 编辑:程序博客网 时间:2024/04/28 02:41
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.
Illustration
A 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
- (简单dp) poj 3356 AGTC
- poj 3356 AGTC 简单dp
- POJ 3356 AGTC(DP)
- POJ 3356 AGTC(经典DP Edit Distance)
- poj 3356 AGTC(dp,最小编辑距离)
- POJ 3356 AGTC (编辑距离 DP)
- POJ 3356-AGTC(区间DP)
- POJ 3356.AGTC(DP)
- PKU3356 AGTC (简单DP)
- POJ 3356 AGTC(最短编辑距离 DP)
- POJ 3356 AGTC 解题报告(Edit Distance,DP)
- poj 3356 AGTC(dp 求最短编辑距离)
- POJ--3356:AGTC (DP求最长公共子序列)
- POJ 3356 AGTC 【最短编辑距离,经典DP】
- POJ 3356 AGTC(经典DP最短编辑距离)
- POJ 3356 AGTC(dp之公共最长子序列)
- poj 3356 AGTC
- poj 3356 AGTC
- c#匿名类型
- PHP开发经验总结
- linux svn命令大全
- 中文编码基础知识介绍
- SOA
- (简单dp) poj 3356 AGTC
- Windows Azure 真实案例:欧洲环境局(EEA)-环境局的开创性在线工具带给公民革命性的数据
- Java List 排序
- QTP
- [Forward]WCF分布式开发必备知识(1):MSMQ消息队列
- sqlserver 创建和删除table 主键
- [VBA] excel vba控件常规使用
- build.xml
- 《深入解析ORACLE》学习笔记(3)---ORACLE中的DB_NAME,SERVICE_NAME,INSTANCE_NAME,ORACLE_SID,GLOBAL_DBNAME介绍