日常训练2025-1-2

合集 - 日常刷题(44)

1.日常刷题2025-3-1603-16

2.日常训练2025-1-201-02

3.日常训练2025-1-301-034.日常训练2025-1-501-055.日常训练2025-1-801-086.日常训练2025-1-1101-117.日常训练2025-1-1201-128.日常训练2025-1-1301-139.日常训练2025-1-1401-1410.日常训练2025-1-1501-1511.日常训练2025-1-1601-1612.日常训练2025-1-1701-1713.日常训练2025-1-1801-1814.日常训练2025-1-1901-1915.日常训练2025-1-2101-2116.日常训练2025-1-2201-2217.日常刷题2025-1-2301-2318.日常训练2025-1-2401-2419.日常刷题2025-1-2501-2520.日常刷题02-0121.日常刷题2025-2-602-0622.日常刷题2025-2-902-0923.日常刷题2025-2-1402-1424.日常刷题2025-2-1502-1525.日常刷题2025-2-1702-1726.日常刷题2025-2-2002-2027.日常刷题2025-2-2102-2128.日常刷题2025-2-2202-2229.日常刷题2025-2-2402-2430.日常刷题2025-2-2602-2631.日常刷题2025-2-2702-2732.日常刷题2025-2-2802-2833.日常刷题2025-3-103-0134.日常刷题2025-3-203-0235.日常刷题2025-3-303-0336.日常刷题2025-3-503-0537.日常刷题2025-3-603-0638.日常刷题2025-3-703-0739.日常刷题2025-3-803-0840.日常刷题2025-3-903-0941.日常刷题2025-3-1003-1042.日常刷题2023-3-1103-1143.日常刷题2025-3-1303-1344.非常棒的二分和DP03-15

收起

日常训练2025-1-2

D. Digital string maximization

rating:1300

https://codeforces.com/contest/2050/problem/D

思路：找trick + 暴力

根据题意，一个数值为 i 的数最多向左移动 i 步。而最大的数为 9 ，也就是说对于一个位置 x ，他的值只可能来自于 $[x,x+9]$ 这个范围，更远的那些数不可能移动过来

所以即使是暴力时间复杂度也不过是$O(9\ast n)$​

评述

好烦这道题！！

代码

#include <bits/stdc++.h>
 
typedef std::pair<int, int> pii;
#define INF 0x3f3f3f3f
#define MOD 998244353
using i64 = long long;
const int N = 1e5+5;
 
void solve(){
	std::string s;
	std::cin >> s;
 
	int n = s.size();
 
	for (int i = 0; i < n; i++){
		int cur = s[i] - '0';
		int pos = -1;
		for (int j = i; j < n && j < i + 10; j++){
			if (s[j] - '0' - j + i > cur){
				pos = j;
				cur = s[j] - '0' - j + i;
			}
		}
		if (pos != -1){
			for (int k = pos; k >= i + 1; k--){
				s[k]--;
				std::swap(s[k], s[k-1]);
			}
		}
	}
 
	std::cout << s << '\n';
}
 
signed main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout<<std::setiosflags(std::ios::fixed)<<std::setprecision(2);
	int t = 1, i;
	std::cin >> t;
	for (i = 0; i < t; i++){
		solve();
	}
	return 0;
}

B. pspspsps

rating:1300

https://codeforces.com/problemset/problem/2049/B

思路（找trick）

直接找规律吧，没啥其他方法

代码

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
 
#if !defined(ONLINE_JUDGE) && defined(LOCAL)
#include "helper.h"
bool IS_LOCAL = true;
#else
#define dbg(...) ;
bool IS_LOCAL = false;
#endif
 
void go() {
    int n;
    string s;
    cin >> n >> s;
    if (n == 1) {
        cout << "YES" << endl;
    } else if (!s.contains('s') || !s.contains('p')) {
        cout << "YES" << endl;
    } else if (s[0] == 's' && !s.substr(1, s.size() - 1).contains('s')) {
        cout << "YES" << endl;
    } else if (s[n - 1] == 'p' && !s.substr(0, n - 1).contains('p')) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    if (IS_LOCAL)
        std::cout << std::unitbuf;
    for (int batch = 1;; batch++) {
        int caseCnt;
        cin >> caseCnt;
        if (!caseCnt || cin.fail())
            break;
        for (int i = 1; i <= caseCnt; i++) {
            dbg(batch, i);
            go();
        }
    }
    return 0;
}