Kato_Shoko

分类

/ 注册

全部文章（共64篇）

题解 | 被打乱的异或和

不难发现n-1个数字的异或和刚好等于最后一个数字，将这个数字放到数组里面后，整个数组异或为0，所以数组里面的任意一个数字都可以是答案，因为它与剩下的数字的异或也是0。 #include <bits/stdc++.h> #define il inline using namespace ...

2025-08-09

0 20

题解 | 最大子段和

#include <bits/stdc++.h> #define il inline using namespace std; using ll = long long; using ull = unsigned long long; using int128=__int128_t; ...

2025-08-09

0 21

题解 | 最长不下降子序列

#include <bits/stdc++.h> #define il inline using namespace std; using ll = long long; using ull = unsigned long long; const ll N = 1e5 + 5, mo...

2025-08-09

0 20

题解 | 【模板】序列操作

#include <bits/stdc++.h> #define il inline using namespace std; using ll = long long; using ull = unsigned long long; using int128=__int128_t; ...

2025-08-06

0 24

题解 | 谐距下标对

#include <bits/stdc++.h> #define il inline using namespace std; using ll = long long; using ull = unsigned long long; using int128=__int128_t; ...

2025-08-04

0 18

题解 | 斗兽棋

#include <bits/stdc++.h> #define il inline using namespace std; using ll = long long; using ull = unsigned long long; using int128=__int128_t; ...

2025-08-04

0 17

题解 | 称砝码

#include <iostream> #include <queue> #include <map> #include <set> #include <cmath> #include <cstring> #include &l...

2025-03-12

0 62

题解 | 合并表记录

#include <iostream> #include <queue> #include <map> #include <set> #include <cmath> #include <cstring> #include &l...

2025-03-12

0 56

题解 | 进制转换

#include <iostream> #include <queue> #include <map> #include <set> #include <cmath> #include <cstring> #include &l...

2025-03-12

0 57

题解 | 删除字符串中出现次数最少的字符

#include <iostream> #include <queue> #include <map> #include <set> #include <cmath> #include <cstring> #include &l...

2025-03-10

0 53