zoukankan      html  css  js  c++  java
  • D

    D - Mike and strings

    Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec".

    Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?

    Input

    The first line contains integer n (1 ≤ n ≤ 50) — the number of strings.

    This is followed by n lines which contain a string each. The i-th line corresponding to string si. Lengths of strings are equal. Lengths of each string is positive and don't exceed 50.

    Output

    Print the minimal number of moves Mike needs in order to make all the strings equal or print  - 1 if there is no solution.

    Example

    Input
    4
    xzzwo
    zwoxz
    zzwox
    xzzwo
    Output
    5
    Input
    2
    molzv
    lzvmo
    Output
    2
    Input
    3
    kc
    kc
    kc
    Output
    0
    Input
    3
    aa
    aa
    ab
    Output
    -1
    题意:输入一个整数n,然后输入n个长度相同的字符串,如果能通过循环位移使这n个字符串都相等,输出最小的操作次数,如果不能,输出-1;
    题解:1.首先判断能不能通过循环位移使这n个字符串都相等
        2.计算把第第1,2。。。n行字符串当模板使所有字符串都相等的操作次数
        3.输出最小的值。
    代码
    #include<iostream>
    #include<string>
    #include<algorithm>
    #include<cstring>
    #include<cstdlib>
    using namespace std;
    int main()
    {
        string str[55];
        int i,j,n,ans[55],k,book=0;
        int x[55],b;
        cin>>n;string T,W;
    
        memset(x,0,sizeof(x));
    
        memset(ans,0,sizeof(ans));
    
        for(i=1;i<=n;i++)
        {
            cin>>str[i];
        }
    
        for(i=0;i<str[1].size();i++)
        {
            T="";
            for(j=i;j<str[1].size();j++)
                T+=str[1][j];
            for(j=0;j<i;j++)
                T+=str[1][j];
    //判断是否可以通过转换换成相同的字符串
            for(j=2;j<=n;j++)
            {
                if(ans[j]==0)
                {
                    if(T==str[j])
                    {
                        ans[j]=1;
                    }
                }
                else
                    continue;
            }
        }
    
        for(i=2;i<=n;i++)
        {
            if(ans[i]==0)
            {
                book=1;
                break;
            }
        }
    
        int z;
    
        if(book==1)
            cout<<-1<<endl;
    
        else
            {
                for(i=1;i<=n;i++)
                {
                    T=str[i];
    
                    for(k=1;k<=n;k++)
                    {
                        for(j=0;j<str[k].size();j++)
                        {
                            W="";
                        for(z=j;z<str[k].size();z++)
                            W+=str[k][z];
                        for(z=0;z<j;z++)
                            W+=str[k][z];
                        if(W==T)
                            {
                               b=j;
                               break;
                            }
                        }
                    x[i]+=b;
                    }
                }
                cout<<*min_element(x+1,x+1+n)<<endl;
            }
    }

     

  • 相关阅读:
    Rsync命令参数详解
    mysql 主从同步如何 把从数据的版本升级到指定的版本
    MySQL同步故障:" Slave_SQL_Running:No" 两种解决办法 (转)
    Linux VPS/服务器 网站及数据库自动本地备份并FTP上传备份脚本
    在kloxo中把不带www的域名做301到带www的域名
    mysql sorce 导入数据乱码问题解决
    linux后台运行和关闭SSH运行,查看后台任务
    centos下MySQL主从同步配置
    ecshop 无法上传产品图片 服务环境少了GD库
    EOJ2902 Contest
  • 原文地址:https://www.cnblogs.com/GXXX/p/6814550.html
Copyright © 2011-2022 走看看