olone
olone
全部文章
分类
归档
标签
去牛客网
登录
/
注册
olone的博客
全部文章
(共67篇)
题解 | 【模板】最近公共祖先(LCA)
#include<bits/stdc++.h> using namespace std; const int N = 5e5 + 5; int n, m, r; int fa[N][20], d[N]; vector<int> e[N]; inline void b...
2026-05-13
0
24
题解 | 小红的矩阵染色
#include<bits/stdc++.h> using namespace std; int main() { int n, m, k; cin>>n>>m>>k; vector<vector<char>...
2026-05-07
0
26
题解 | Poi 的新加法(Easy Version)
#include<bits/stdc++.h> using namespace std; typedef long long LL; const int N = 1e6 + 5; int T; int n, q; LL a[N]; inline void solve(){ ...
2026-04-26
0
30
题解 | 小苯的01背包(easy)
#include<bits/stdc++.h> using namespace std; const int N = 2e3 + 5; int n, k; int v[N], w[N]; int f[N]; bool vis[N][N]; vector<int> V...
2026-04-25
0
35
题解 | 最大稳定数值
#include<bits/stdc++.h> using namespace std; typedef long long LL; const int N = 1e5 + 5; int n; int a[N]; LL prefix[N]; bool is_support[N], ...
2026-04-22
0
40
题解 | 穷哈哈~
import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); public static void main(String[] args){ int ...
2026-04-20
0
33
题解 | 小红的完全二叉树构造
import java.util.*; public class Main{ static Scanner in = new Scanner(System.in); public static void main(String[] args){ int n = in...
2026-04-19
0
35
题解 | 分元宵
import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); static long mod; public static long qpower(long...
2026-04-17
0
31
题解 | 数独数组
import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); public static void main(String[] args){ int ...
2026-04-15
0
46
题解 | 元素方碑
import java.util.Scanner; public class Main{ static Scanner in = new Scanner(System.in); public static void solve(){ int n = in.ne...
2026-04-13
0
43
首页
上一页
1
2
3
4
5
6
7
下一页
末页