Codeforces822 B. Crossword solving
来源:互联网 发布:如何重装mac os x 编辑:程序博客网 时间:2024/05/18 01:07
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 strings="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 tcorrespondingly.
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
题目的意思是给出两个字符串,可以把第一个字符串任意位置变成任意的字母使他成为
另一个的子串,求最少变的数量和位置
思路:n^2暴力匹配
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <cmath>#include <algorithm>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;char a[1005],b[1005];int main(){ int n,m; scanf("%d%d",&m,&n); scanf("%s",a); scanf("%s",b); int mn=INF; vector<int>x; vector<int>ans; for(int i=0; i<=n-m; i++) { x.clear(); for(int j=0;j<m;j++) { if(b[i+j]!=a[j]) x.push_back(j+1); } if(mn>x.size()) { ans.clear(); mn=x.size(); for(int i=0;i<mn;i++) ans.push_back(x[i]); } } printf("%d\n",mn); int q=0; for(int i=0;i<mn;i++) { if(q++) printf(" "); printf("%d",ans[i]); } printf("\n"); return 0;}
- Codeforces822 B. Crossword solving
- B. Crossword solving
- B. Crossword solving
- CF422 div2 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
- 0706 CF#822A-I'm bored with life #822B-Crossword solving
- Codeforces 90B-African Crossword
- CodeForces 90B African Crossword【模拟】
- solving
- Codeforces Beta Round #74 (Div. 2) / 90B African Crossword (模拟)
- 用mysql-connector-java 6.0.5引发的问题解决方法
- Java还要再学一遍基础(十六)- DelayQueue使用
- 下半年值得关注的新机和科技趋势
- table中边框在firefox中不显示的问题
- PAT甲级 1004. Counting Leaves (30)
- Codeforces822 B. Crossword solving
- Bootstrap Table笔记——1
- Laravel代码智能提示[PhpStorm]
- 下半年值得关注的新机和科技趋势
- memcache介绍、安装及应用
- 为什么我们像驯化小狗那样驯化算法
- Ubuntu 14.04 安装tensorflow
- Android开发中的JavaBean类
- TensorFlow saver之指定变量的存取