C. Substring Game in the Lesson ( 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\n"; } else { minn=s[i]; cout<<"Mike\n"; } } }

 

转载于:https://www.cnblogs.com/Shallow-dream/p/11588001.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值