POJ 1936(字符串匹配) 解题报告
2011-04-04 11:28
447 查看
/*_______________________________________________POJ 1936题___________________________________________________________ All in All Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 18702 Accepted: 7442 Description: You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string. Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can remove characters from t such that the concatenation of the remaining characters is s. Input: The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace.The length of s and t will no more than 100000. Output: For each test case output "Yes", if s is a subsequence of t,otherwise output "No". Sample Input sequence subsequence person compression VERDI vivaVittorioEmanueleReDiItalia caseDoesMatter CaseDoesMatter Sample Output Yes No Yes No __________________________________________________________________________________________________________________*/ #include<stdio.h> #include<string.h> int main() { int i,j,m,n; char s[100000]={'/0'}, t[100000]={'/0'}; // FILE *fin=fopen("input.txt","r"); while( scanf("%s%s",s,t)==2 ) { m=strlen(s); //注:一定要提前计算好长度,不要每次循环判断条件中都临时计算长度,太费时间 n=strlen(t); if(m>n) { printf("No/n"); continue; } for(i=0,j=0; i<m && j<n ;) { if(s[i]==t[j]) { i++; j++; } else { j++; } } if(j=n && i<m ) //t串扫描完而s串还没扫完 printf("No/n"); else printf("Yes/n"); } return 0; } //(1)测试例 “aa a”提醒我应该先比较s t 的长度 //(2)第一版因为将strlen(s)写到了循环判断条件里,导致超时 //(3)竟然将Yes No写成YES NO
相关文章推荐
- POJ 1936(字符串匹配) 解题报告
- POJ 1936(字符串匹配)
- 串结构练习——字符串匹配 解题报告
- 串结构练习――字符串匹配 解题报告
- POJ 1936 All in All 字符串匹配
- POJ 2742 统计字符数 解题报告
- poj解题报告——1936
- [POJ](1936)All in All ---字符串匹配(串)
- 【Noi OpenJudge】 带通配符的字符串匹配 解题报告
- poj 1936 All in All 简单的字符串匹配
- poj 2406 Power Strings(字符问题)(解题报告)
- POJ 1936 解题报告
- 简单的字符串匹配 poj1936
- POJ - 1936 All in All解题报告
- POJ2236详细的解题报告(C语言版)
- poj 1887解题报告
- POJ 3358 Period of an Infinite Binary Expansion 解题报告(欧拉函数+因式分解)
- POJ 1160 DP 解题报告
- poj解题报告——1276
- POJ 1006 Biorhythms 解题报告(中国剩余定理)