努力变强2

分类

/ 注册

全部文章（共21篇）

题解 | #游游的元素修改#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 9982...

2024-11-28

0 30

题解 | #小美的树上染色#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 1e5 + 10; const int MOD = 9982...

2024-11-28

0 24

题解 | #小红的01串#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e6 + 10; const int MOD = 9982...

2024-11-28

0 39

题解 | #平均数为k的最长连续子数组#

同时减去k后，求最长连续子数组和为0的值即可代码： using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 998244...

2024-11-21

0 41

题解 | #小欧的括号嵌套#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 9982...

2024-11-19

0 48

题解 | #小红的区间查询#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 9982...

2024-11-19

0 27

题解 | #小红的好数#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 9982...

2024-11-19

0 37

题解 | #小欧的数组修改#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 9982...

2024-11-19

0 32

题解 | #压缩二维码#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 9982...

2024-11-19

0 38

题解 | #游游的除2操作#

#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll>PII; const int N = 2e5 + 10; const int MOD = 9982...

2024-11-19

0 45