CF—822B Crossword solving
来源:互联网 发布:matlab 数组重复拼接 编辑:程序博客网 时间:2024/06/06 04:59
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
#include<iostream>#include<stdio.h>#include<queue>#include<algorithm>#define maxn 1001using namespace std;int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF) { char a[maxn]; char b[maxn]; int c[maxn]; scanf("%s%s",a,b); int i,j,k,ans; queue<int> que; for(i=0;i<n;i++) c[i]=i+1; ans=n; for(i=0;i<=m-n;i++) { int t=0; for(j=i,k=0;k<n;j++) { if(b[j]==a[k]) t++; k++; } if(ans==n-t) continue; ans=min(ans,n-t); if(ans==n-t) { for(j=i,k=0,t=0;k<n;j++) { if(b[j]!=a[k]) { c[t]=k+1; t++; } k++; } } } printf("%d\n",ans); for(i=0;i<ans;i++) { if(i==ans-1) printf("%d\n",c[i]); else printf("%d ",c[i]); } }}
- CF—822B Crossword solving
- codeforces 822 B Crossword solving
- CodeForces 822B Crossword solving
- Codeforces 822B Crossword solving
- 0706 CF#822A-I'm bored with life #822B-Crossword solving
- codeforces 822B(Crossword solving) Java
- codeforces 822-B. Crossword solving(vector)
- Codeforces822 B. Crossword solving
- B. Crossword solving
- B. Crossword solving
- CF422 div2 B. Crossword solving
- Codeforces Round #422 B. Crossword solving
- Codeforces Round #422 (Div. 2) B. Crossword solving
- Codeforces Round #422 (Div. 2) B. Crossword solving
- Codeforces 90B-African Crossword
- cf——B. Garland
- cf-B
- cf B
- JAVA 三元运算符
- 正儿八经第一次应聘安卓开发的经历
- CodeForces 718C Sasha and Array(矩阵类+线段树)
- 对于字典序排列的进一步简化
- 1.对象导论
- CF—822B Crossword solving
- CentOS打开关闭端口
- hdu1816Get Luffy Out * (2-sat)
- 封锁阳光大学【二分图染色】洛谷P1330
- ubuntu16.04下安装qtcreator
- 分数化小数(decimal)
- TensorFlow学习1-搭建环境开始
- sql server 的T-SQL 学习笔记(七)
- 内部排序-插入排序