原题链接 You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string. Return the lexicographically smallest string you could have aft
A - Increasing Sequence 直接从1开始模拟就行 #include<bits/stdc++.h>using namespace std;const int N =2e5+10,mod=998244353;#define int long longtypedef long long LL;typedef pair<int, int> PII;const long