摘要:
最长公共子序列 #include <bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int id[N],b[N]; int n; int g[N]; int main(){ cin >> n; int x; for(int i 阅读全文
posted @ 2025-11-05 21:15
XYu1230
阅读(3)
评论(0)
推荐(0)
摘要:
#include<bits/stdc++.h> using namespace std; #define N 200005 int fa[N]; int sz[N]; int find(int x){ return fa[x] == x ? x : find(fa[x]); } int main() 阅读全文
posted @ 2025-11-05 21:15
XYu1230
阅读(3)
评论(0)
推荐(0)
摘要:
#include<bits/stdc++.h> using namespace std; #define PII pair<int,int> const int N = 510; const int INF = 1e9; int n,m,s,d; int num[N],dis[N],last[N], 阅读全文
posted @ 2025-11-05 21:15
XYu1230
阅读(2)
评论(0)
推荐(0)
摘要:
/** * https://www.luogu.com.cn/problem/P1226 */ #include<bits/stdc++.h> using namespace std; #define ll long long int a,b,p; ll ans; ll quickPower(ll 阅读全文
posted @ 2025-11-05 21:14
XYu1230
阅读(3)
评论(0)
推荐(0)
摘要:
C++ 阅读全文
posted @ 2025-11-05 21:13
XYu1230
阅读(3)
评论(0)
推荐(0)

浙公网安备 33010602011771号