Open utterances-bot opened 8 months ago
A. Stair, Peak, or Neither? 思路:
按照题目意思进行判断即可
时间复杂度:(O(1)) 1234567891011121314151617181920212223242526272829303132#include <bits/stdc++.h>using i64 = long long;void solve() { in
https://christins.online/2024/03/29/Codeforces-Round-937-Div-4/
嘿嘿
Codeforces Round 937 (Div. 4) | Chen's Blog
A. Stair, Peak, or Neither? 思路:
按照题目意思进行判断即可
时间复杂度:(O(1)) 1234567891011121314151617181920212223242526272829303132#include <bits/stdc++.h>using i64 = long long;void solve() { in
https://christins.online/2024/03/29/Codeforces-Round-937-Div-4/