- 博客(12)
- 收藏
- 关注
原创 HDU 4912 Paths on the tree (树链剖分+线段树+DP)
#include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define lson l,m...
2020-03-31 19:54:28 194
原创 CodeForces 1062E Company (主席树第k大+dfs序性质)
#include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define lson l,m...
2020-03-30 21:53:22 241
原创 CodeForces 373D Counting Rectangles is Fun (四维DP)
#include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define lson l,m...
2020-03-27 16:29:07 166
原创 CodeForces 853C Boredom (主席树+分类讨论)
#include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define lson l,m...
2020-03-27 10:36:50 238
原创 HDU 5029 Relief grain (树链剖分+权值线段树思想)
#include<bits/stdc++.h> using namespace std; #define debug cout<<"YES\n"; #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define ...
2020-03-26 18:10:52 190
原创 HDU 5296 Annoying problem (树剖求LCA+链的距离)
#include<bits/stdc++.h> using namespace std; #define debug cout<<"YES\n"; #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define ...
2020-03-23 19:32:29 120
原创 HDU 5293 Tree chain problem (树链剖分+LCA+树形DP)
#include<bits/stdc++.h> using namespace std; #pragma comment(linker, "/STACK:1024000000,1024000000") #define debug cout<<"YES\n"; #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #de...
2020-03-21 11:34:28 164
原创 CodeForces 208E Blood Cousins (启发式合并+倍增)
#include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define lson l,m...
2020-03-20 00:12:15 176
原创 CodeForces 246E Blood Cousins Return (树上启发式合并)
#include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define lson l,m...
2020-03-18 08:36:07 208
原创 HDU 5452 Minimum Cut (树链剖分)
#include<bits/stdc++.h> using namespace std; #define debug cout<<"YES\n"; #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define ...
2020-03-17 15:17:23 131 1
原创 ZOJ 4053 Couleur (启发式合并+主席树)
#include<bits/stdc++.h> using namespace std; #define debug cout<<"YES\n"; #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define ...
2020-03-10 17:31:59 223
原创 P4211 [LNOI2014]LCA (树链剖分+思维)
#include<bits/stdc++.h> using namespace std; #define debug cout<<"YES\n"; #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define ...
2020-03-09 00:38:46 134
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人