Codeforces - 1155A - Reverse a Substring
地址https://codeforces.com/contest/1155/problem/A原文地址https://www.lucien.ink/archives/417/题意给你一个串 $s$ ,问能否翻转一个区间使得它的字典序变小。题解先 sort 一下判断是否可以,可以的话枚举一下。代码https://pasteme.cn/6687#include <bits/stdc++.h...
地址https://codeforces.com/contest/1155/problem/A原文地址https://www.lucien.ink/archives/417/题意给你一个串 $s$ ,问能否翻转一个区间使得它的字典序变小。题解先 sort 一下判断是否可以,可以的话枚举一下。代码https://pasteme.cn/6687#include <bits/stdc++.h...
地址https://codeforces.com/contest/1153/problem/D原文地址https://www.lucien.ink/archives/416代码https://pasteme.cn/6251#include <bits/stdc++.h> const int maxn = int(3e5) + 7; std::vector<int> e...
地址https://codeforces.com/contest/1153/problem/C原文地址https://www.lucien.ink/archives/415代码https://pasteme.cn/6250#include <bits/stdc++.h> const int maxn = int(1e6) + 7; int len, left, right; ch...
地址https://codeforces.com/contest/1153/problem/B原文地址https://www.lucien.ink/archives/414代码https://pasteme.cn/6248#include <bits/stdc++.h> const int maxn = 1007; int N, M, H, m[maxn], n[maxn], h...
地址https://codeforces.com/contest/1153/problem/A原文地址https://www.lucien.ink/archives/413代码https://pasteme.cn/6247#include <bits/stdc++.h> int main() { int n, m, min = 0x3f3f3f3f, ans, buf; ...