zoukankan      html  css  js  c++  java
  • CF-822B

    B. Crossword solving
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.

    Input

    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.

    Output

    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.

    Examples
    input
    3 5
    abc
    xaybz
    output
    2
    2 3
    input
    4 10
    abcd
    ebceabazcd
    output
    1
    2

    题意:

    ‘?’为模糊字符,求最少要将第一个串替换多少个‘?’才能使其成为第二个串的子串。

    暴力啊

    AC代码:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 const int INF=1<<30;
     5 
     6 string s,t;
     7 int n,m;
     8 vector<int> x,y;
     9 int main(){
    10     cin>>n>>m;
    11     cin>>s>>t;
    12     int MIN=INF;
    13     for(int i=0;i<=m-n;i++){
    14         x.clear();
    15         for(int j=0;j<n;j++){
    16             if(s[j]!=t[i+j]){
    17                 x.push_back(j+1);
    18                 //cout<<j+1<<" ";
    19             }
    20         }
    21         if(MIN>x.size()){
    22             y.clear();
    23             MIN=x.size();
    24             for(int k=0;k<x.size();k++){
    25                 y.push_back(x[k]);
    26                 //cout<<x[k]<<endl;
    27             }
    28         }
    29         //cout<<MIN<<endl;
    30     }
    31     cout<<MIN<<endl;
    32     for(int i=0;i<MIN;i++){
    33         cout<<y[i]<<" ";
    34     }
    35     cout<<endl;
    36     return 0;
    37 }
  • 相关阅读:
    引导用户关注公众号
    python计算两组数据的P值
    【style-resources-loader】自动化导入CSS
    【concurrently】前端工程化并行解决方案
    【已解决】K8s + Ingress + Nodejs代理服务报错:413 Request Entity Too Large
    Python定时任务框架APScheduler实战Demo
    前端团队codeReview规范以及流程
    Git使用关键理解
    Vue+ESLint+Git钩子函数pre-commit配置教程
    【MongoDB】查询字段对应的数组中包含某个值
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/7252578.html
Copyright © 2011-2022 走看看