CF422 div2 B. Crossword solving
来源:互联网 发布:linux传送文件命令 编辑:程序博客网 时间:2024/06/06 07:23
Erelong Leha was bored by calculating of the greatest common divisor of two factorials. Therefore he decided to solve some crosswords. It's well known that it is a very interesting occupation though it can be very difficult from time to time. In the course of solving one of the crosswords, Leha had to solve a simple task. You are able to do it too, aren't you?
Leha has two strings s and t. The hacker wants to change the string s at such way, that it can be found in t as a substring. All the changes should be the following: Leha chooses one position in the string s and replaces the symbol in this position with the question mark "?". The hacker is sure that the question mark in comparison can play the role of an arbitrary symbol. For example, if he gets string s="ab?b" as a result, it will appear in t="aabrbb" as a substring.
Guaranteed that the length of the string s doesn't exceed the length of the string t. Help the hacker to replace in s as few symbols as possible so that the result of the replacements can be found in t as a substring. The symbol "?" should be considered equal to any other symbol.
The first line contains two integers n and m (1 ≤ n ≤ m ≤ 1000) — the length of the string s and the length of the string t correspondingly.
The second line contains n lowercase English letters — string s.
The third line contains m lowercase English letters — string t.
In the first line print single integer k — the minimal number of symbols that need to be replaced.
In the second line print k distinct integers denoting the positions of symbols in the string s which need to be replaced. Print the positions in any order. If there are several solutions print any of them. The numbering of the positions begins from one.
3 5abcxaybz
22 3
4 10abcdebceabazcd
12
看范围n2,直接数组平移。
#include<bits/stdc++.h>using namespace std;const int MAXN=1e3+7;const int inf = 1e9;int n,m;char s[MAXN],t[MAXN];int ans[MAXN],temp[MAXN];int main(){ scanf("%d%d",&n,&m); scanf("%s%s",s,t); int MIN = inf; for(int i = 0 ; i <= m-n ; ++i) { int cnt = 0; for(int j = 0 ; j < n ;++j) { if(t[i+j] != s[j]) { temp[cnt++] = j+1; } } if(cnt < MIN) { MIN = cnt; memcpy(ans,temp,sizeof temp); } } printf("%d\n",MIN); for(int i = 0 ; i < MIN ; ++i)printf("%d ",ans[i]);}
- CF422 div2 B. Crossword solving
- Codeforces822 B. Crossword solving
- B. Crossword solving
- B. Crossword solving
- codeforces 822 B Crossword solving
- CodeForces 822B Crossword solving
- Codeforces 822B Crossword solving
- codeforces 822B(Crossword solving) Java
- Codeforces Round #422 B. Crossword solving
- CF—822B Crossword solving
- codeforces 822-B. Crossword solving(vector)
- Codeforces Round #422 (Div. 2) B. Crossword solving
- Codeforces Round #422 (Div. 2) B. Crossword solving
- CF422 div2 C. Hacker, pack your bags!
- 0706 CF#822A-I'm bored with life #822B-Crossword solving
- Codeforces 90B-African Crossword
- CodeForces 90B African Crossword【模拟】
- codeforces 105 div2 B
- hdu1907John(NIM博弈变形)
- javaScript_BOM_增加删除节点
- cvFindContours
- MySql数据库sql优化
- 在vue项目中正确的引入jquery
- CF422 div2 B. Crossword solving
- sql for xml path用法
- cocos2dx-lua笔记
- Ubuntu 文件夹右小角有锁的问题解决
- 文件格式之gif
- [BZOJ]2154: Crash的数字表格&&2693: jzptab
- 自动化脚本编写实例-python
- jquery detach()和remove()的区别
- tomcat工作原理浅析