I. Idiotic Suffix Array【GDUT 2022 grade Qualifying # 2】

I. Idiotic Suffix Array

原题链接

题意

构造出一个长度为n只由小写字母组成且首位字符的后缀串在字典序中排第k的字符串
baaa...aa(k-1)cc...ccc(n-k)

代码

点击查看代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<cctype>
using namespace std;

#define X first
#define Y second

typedef pair<int,int> pii;
typedef long long LL;
const char nl = '\n';
const int N = 1e6+10;
const int M = 2e5+10;
int n,k;

void solve(){
	cin >> n >> k;
	string s = "b";
	for(int i = 1; i <= k - 1; i ++ )s += 'a';
	for(int i = k; i <= n - 1; i ++ )s += 'c';
	cout << s;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);

	solve();
}

注意

suffixes.emplace_back(s.substr(i), i);相当于suffixes.push_back({s.substr(i), i});

单词

the Suffix Array后缀数组
lowercase letters小写字母
lexicographical order字典序