jinii

未归档

题解(2)

/ 注册

全部文章 / 未归档（共45篇）

树的重心

POJ 3107 远古版本的oj，提交用c++98，卡vector，必须用链式前向星，绷不住了 #include <stdio.h> #include <algorithm> using namespace std; const int N = 50005; struct...

C++ 树的重心

2025-03-10

0 52

树的直径

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

C++ 树的直径

2025-03-10

0 50

最近共同祖先(LCA)

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

C++ LCA

2025-03-10

0 64

水题！！！！！！(dij)

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

C++ dij 搜索

2025-03-04

0 72

最小生成树(kruskal)(prim参考dijkstra)

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

板子最小生成树 kruskal

2025-01-28

0 77

字典树板子

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

板子字典树

2025-01-27

0 70

dijkstra板子

#include<bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int,int>; using db = d...

板子最短路 dijkstra

2025-01-27

0 51

快读快写

inline int read() { int x = 0, f = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); } whil...

板子快读快写

2025-01-27

0 61

高精度模版（高精/高精）

#include<bits/stdc++.h> using namespace std; #define int long long vector<int> exchange(string s){ vector<int> A; int len=s....

板子高精度

2025-01-27

0 58

树状数组板子

#include<bits/stdc++.h> using namespace std; #define int long long #define lowbit(x) (x&-(x)) const int N=1e5; int tree1[N]; int tree2[N]; i...

板子树状数组

2025-01-27

0 67