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

    链接:

    https://codeforces.com/contest/1220/problem/C

    题意:

    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 s and a number k (0≤k<|s|).

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

    A player chooses l′ and r′ so that l′≤l, r′≥r and s[l′,r′] is lexicographically less than s[l,r]. Then the player changes l and r in this way: l:=l′, r:=r′.
    Ann moves first.
    The player, that can't make a move loses.
    Recall that a substring s[l,r] (l≤r) of a string s is a continuous segment of letters from s that starts at position l and ends at position r. For example, "ehn" is a substring (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 s and k.

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

    思路:

    将l'扩展到右边最小的位置, 就可以保证下一次没有操作余地.
    同时l的左边没有更小的就输了.

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    const int MAXN = 5e5+10;
    
    char s[MAXN];
    
    int main()
    {
        cin >> s;
        int len = strlen(s);
        int minv = 25;
        for (int i = 0;i < len;i++)
        {
            if (s[i]-'a' > minv)
                puts("Ann");
            else
                puts("Mike");
            if (s[i]-'a' < minv)
                minv = s[i]-'a';
        }
        
        return 0;
    }
    
  • 相关阅读:
    数组元素循环右移
    备忘录模式笔记
    调度算法(笔记)
    meta http-equiv的用法(转)
    常用Maven插件介绍(下)(转)
    常用Maven插件介绍(上)(转)
    maven命令
    JDK并发包
    线程基础
    Jav堆排序
  • 原文地址:https://www.cnblogs.com/YDDDD/p/11626658.html
Copyright © 2011-2022 走看看