Codeforces--822B--Crossword solving

题目描述：
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 5
abc
xaybz
4 10
abcd
ebceabazcd
输出：
2
2 3
1
2
题意：
第一个字符串中替换几个字符可以在第二个字符串中找到 输出最小替换数 以及替换位置
题解：
直接暴力搞
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn = 1000 + 5;

char a[maxn],b[maxn];
int ans[maxn];

int main(){
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF){
		scanf("%s",a);
		scanf("%s",b);
		int min = 10000;
		int count = 0;
		memset(ans,0,sizeof(ans));
		for(int i = 0; i <= (m - n); i ++){

			count = 0;
			for(int j = 0; j < n; j ++){
				if(a[j] != b[i + j]){
					count++;
				}
			}
			if(min > count)
			{
				min = count;
				memset(ans,0,sizeof(ans));
                for(int j = 0; j < n; j ++){
						if(a[j] != b[i + j]){
							ans[j] = 1;
						}
					}
			}
		}
        printf("%d\n",min);
		for(int i = 0; i < n; i++){
			if(ans[i] == 1)
			printf("%d ",i + 1);
		}
		printf("\n");
	}
	return 0;
}