Codeforces Round #422 (Div. 2) B. Crossword solving

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1010;
char s[MAXN],t[MAXN];
int n,m;
int slen = 0,tlen = 0;

int main()
{
    scanf("%d %d",&n,&m);
    scanf(" %s %s",s,t);
    vector<int> res,temp;
    int rescnt = 2020;
    int cnt = 0;
    for(int i = 0; i < m; ++i)
    {
        if(i+n > m) break;
        temp.clear();
        cnt = 0;
        for(int j = 0; j < n; ++j)
        {
            if(s[j] != t[i+j])
            {
                ++cnt;
                temp.push_back(j);
            }
        }
        if(cnt < rescnt)
        {
            rescnt = cnt;
            res = temp;
        }
    }
    printf("%d\n",rescnt);
    for(int i = 0; i < res.size(); ++i)
        printf("%d ",res[i]+1);
    return 0;
}