ZOJ 1733 Common Subsequence【DP】
来源:互联网 发布:软件开发立项报告模板 编辑:程序博客网 时间:2024/05/13 05:51
//2630526 2011-08-17 09:23:56 Accepted 1733 C 0 160 ylwh@Unknown#include <stdio.h>#include <string.h>#define N 999int main(){int ans, t[N], k[N], maxs, i, j, temp;char a[N], b[N];while(scanf(" %s %s", a, b) != EOF){memset(t, 0, sizeof(t));memset(k, 0, sizeof(k));for(i=0; i<strlen(b); i++)if( !k[i] ){maxs = 0;for(j=i; j<strlen(b); j++)if(b[j] == b[i])k[j] = ++maxs;}ans = 0;for(i=0; i<strlen(b); i++){maxs = 0;temp = 0;for(j=0; j<strlen(a); j++){if(t[j] > maxs)maxs = t[j];if(b[i] == a[j]){temp++;if(temp >= k[i])t[j] = maxs + 1;}if(t[j] > ans)ans = t[j];}}printf("%d\n", ans);} return 0;}
- zoj 1733 Common Subsequence dp
- ZOJ 1733 Common Subsequence【DP】
- zoj 1733 Common Subsequence
- zoj 1733 Common Subsequence
- zoj 1733 Common Subsequence
- zoj 1733 - Common Subsequence
- zoj 1733 Common Subsequence
- ZOJ - 1733 Common Subsequence
- ZOJ 1733 Common Subsequence
- ZOJ 1733(Common Subsequence)
- zoj 1733 || hdu 1159 Common Subsequence(Easy , classics DP)
- ZOJ 1733 Common Subsequence(LCS)
- POJ 1458 Common Subsequence (zoj 1733 ) LCS
- Zoj 2432 Greatest Common Increasing Subsequence(DP)
- poj1458 dp Common Subsequence
- Common Subsequence (dp)
- Common Subsequence HDU dp
- Common Subsequence(DP)
- windows xp 自动登录
- 启动出现错误:Starting kernel ...
- 线段树小结
- 制作ubuntu mirror源的镜像服务器
- 生产订单状态相关
- ZOJ 1733 Common Subsequence【DP】
- C++中十进制数转换为二进制数
- The search request was unable to connect to the Search Service
- IE缓存问题详解
- 输入1则输出0,输入0则输出1
- 邮件服务器 POP3协议 详解
- andengine 坐标系统
- 以前的某个程序安装已在安装计算机上创建挂起的文件操作
- dedecms织梦严重0day漏洞(直接进后台)分析及修复