zoukankan      html  css  js  c++  java
  • C. Substring Game in the Lesson (博弈 (盲猜AC) ) ( Codeforces Round #586 (Div. 1 + Div. 2) )

    Mike and Ann are sitting in the classroom. The lesson is boring, so they decided to play an interesting game. Fortunately, all they need to play this game is a string ss and a number kk (0k<|s|0≤k<|s|).

    At the beginning of the game, players are given a substring of ss with left border ll and right border rr, both equal to kk (i.e. initially l=r=kl=r=k). Then players start to make moves one by one, according to the following rules:

    • A player chooses ll′ and rr′ so that lll′≤l, rrr′≥r and s[l,r]s[l′,r′] is lexicographically less than s[l,r]s[l,r]. Then the player changes ll and rr in this way: l:=ll:=l′, r:=rr:=r′.
    • Ann moves first.
    • The player, that can't make a move loses.

    Recall that a substring s[l,r]s[l,r] (lrl≤r) of a string ss is a continuous segment of letters from s that starts at position ll and ends at position rr. For example, "ehn" is a substring (s[3,5]s[3,5]) of "aaaehnsvz" and "ahz" is not.

    Mike and Ann were playing so enthusiastically that they did not notice the teacher approached them. Surprisingly, the teacher didn't scold them, instead of that he said, that he can figure out the winner of the game before it starts, even if he knows only ss and kk.

    Unfortunately, Mike and Ann are not so keen in the game theory, so they ask you to write a program, that takes ss and determines the winner for all possible kk.

    Input

    The first line of the input contains a single string ss (1|s|51051≤|s|≤5⋅105) consisting of lowercase English letters.

    Output

    Print |s||s| lines.

    In the line ii write the name of the winner (print Mike or Ann) in the game with string ss and k=ik=i, if both play optimally

    Examples
    input
    Copy
    abba
    
    output
    Copy
    Mike
    Ann
    Ann
    Mike
    
    input
    Copy
    cba
    
    output
    Copy
    Mike
    Mike
    Mike
    

     

     

     

    #include <bits/stdc++.h>
     
    using namespace std;
    int main()
    {
        string s;
        
        cin>>s;
       char minn='z';
      for(int i=0;i<s.size();i++) { if(minn<s[i]) { cout<<"Ann
    "; } else { minn=s[i]; cout<<"Mike
    "; } } }

     

    所遇皆星河
  • 相关阅读:
    一种字段串的拆分
    获取存储过程返回值的几种方式
    使用表值参数(数据库引擎)
    转 Dynamics CRM Alert and Notification JavaScript Methods
    CRM 2016 自定义对话框
    CRM 2016 子表单中N:1关系 字段要求与新建时的关系
    恢复CRM plugin
    CRM Diagnostics CRM 2016 诊断
    [Windows] Visual Studio 2010 快捷键大全
    [Java] Web开发HTTP状态码整理
  • 原文地址:https://www.cnblogs.com/Shallow-dream/p/11588001.html
Copyright © 2011-2022 走看看