CF 1675E - Replace With the Previous, Minimize

最新推荐文章于 2024-09-29 18:51:32 发布

花生ono

最新推荐文章于 2024-09-29 18:51:32 发布

阅读量116

点赞数 1

分类专栏： Codeforces 文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/qq_37440669/article/details/131687999

版权

Codeforces 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Replace With the Previous, Minimize

You are given a string $s$ of lowercase Latin letters.
The following operation can be used:

select one character (from ‘a’ to ‘z’) that occurs at least once in the string. And replace all such characters in the string with the previous one in alphabetical order on the loop. For example, replace all ‘c’ with ‘b’ or replace all ‘a’ with ‘z’.

And you are given the integer $k$ — the maximum number of operations that can be performed. Find the minimum lexicographically possible string that can be obtained by performing no more than $k$ operations.
The string $a=a_1a_2…a_n$ is lexicographically smaller than the string $b=b_1b_2…b_n$ if there exists an index $k (1 \leq k \leq n)$ such that $a_1=b_1, a_2=b_2, ..., a_k−1=b_k−1$ , but $a_k<b_k$ .

Input
The first line contains a single integer $t (1≤t≤10^4)$ —the number of test cases in the test.
This is followed by descriptions of the test cases.
The first line of each test case contains two integers $n$ and $k (1≤n≤2⋅10^5, 1≤k≤10^9)$ — the size of the string $s$ and the maximum number of operations that can be performed on the string $s$ .
The second line of each test case contains a string $s$ of length $n$ consisting of lowercase Latin letters.
It is guaranteed that the sum $n$ over all test cases does not exceed $2⋅10^5$ .

Output
For each test case, output the lexicographically minimal string that can be obtained from the string $s$ by performing no more than $k$ operations.

Example
input
4
3 2
cba
4 5
fgde
7 5
gndcafb
4 19
ekyv
output
aaa
agaa
bnbbabb
aapp

题目大意
给你一个只有小写字符 $a$ ~ $z$ 构成的字符串 $s$ ，和将字符串 $s$ 内相同字符前移一次的最大次数 $k$ ，且使得该字符串字典序最小，最后输出该字符串。
解题思路
因为要字典序最小，所以我们要尽量使前面的字符转化为字符 $a$ 或者靠近字符 $a$ 。转化分为两种情况:

若该字符能在 $k$ 步内转化为字符 $a$ ，那么其实所有比它小的字符都能转化为字符 $a$ 。
若该字符不能在 $k$ 步内转化为字符 $a$ ，那么就看上一种情况后剩余的步数可以将该字符转化为什么字符，它就是剩余步数可达的字符，把所有在可达字符到该字符之间的字符都可以转化为可达字符。

最后把所有小于等于第一种情况的字符都转化为字符 $a$ 就可以了。

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t; cin>>t;
    while(t--)
    {
        int n, k; cin>>n>>k;
        string s; cin>>s;
        char mxCh = 'a'; //至少可以把字符 a 都换成 a （废话
        for(auto ch:s)
        {
            if(ch-'a' > k) // k 步数不能将 小于或等于 该类字符直接转化为 a (步数不够
            {
                char mnCh = char(ch - (k-mxCh) - 'a'); //剩余步数可达的最小字符
                for(auto& cc:s) //将 可达字符 到 第一个无法直接转化为 a 的字符都转化为可达字符
                    if(cc>=mnCh && cc<=ch) cc = mnCh;
                break;
            }
            mxCh = max(mxCh, ch); //可以将 小于或等于 该类字符直接转化为 a 的字符 (同时 -'a' 后也是用了的步数
        }
        for(auto& cc:s) //把能直接转化为 a 的转化掉
            if(cc <= mxCh) cc = 'a';
        cout<<s<<'\n';
    }
    return 0;
}