一、dp水划分 #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<string> #include<cmath> #define ll long long using namespace std; const int maxn=55; ll dp[maxn][maxn]; int main(void) { int n; while(scanf("%d",&n)!=EOF) { me...

一、 分治： #include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<string> #include<cmath> #define ll long long using namespace std; const int p=9901; const int maxn=100005; int prime[maxn]; bool ha[maxn]={false}; int cnt=0; void Prime(void)...

POJ2976 一、二分 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<map> #define ll long long using namespace std; const int maxn=1100; int n,k; ll a[maxn],b[maxn]; double c[maxn]; const double eps=1e-6; bool check(doubl...

POJ2728 #include<iostream> #include<cstdio> #include<algorithm> #include<queue> #include<cstring> #include<cmath> #include<map> #define ll long long using namespace std; const int maxn=1100; const double eps=1e-6; struct _node { int x,y,z; }b[maxn]; struct n...

POJ3621 #include<iostream> #include<cstdio> #include<algorithm> #include<queue> #include<cstring> #include<cmath> #include<map> #define ll long long using namespace std; const int maxn=5100; const double eps=1e-5; int head[maxn],ver[maxn],nt[maxn],edge[maxn]...

一、nlogn求最长回文串 POJ3974 #include<iostream> #include<cstdio> #include<algorithm> #include<queue> #include<cstring> #include<cmath> #include<map> #define ll long long #define llu unsigned long long using namespace std; const int maxn=1000010; char str[maxn]; llu...

一、模板： ①倍增nlogn： #include<iostream> #include<cstdio> #include<cstring> #include<string> #include<algorithm> #include<vector> #define ll long long using namespace std; const int maxn=1000005; int sa[maxn],rak[maxn],tax[maxn],tp[maxn],height[maxn]; char str[maxn]; in...

一、模板： 洛谷P3804 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #define ll long long #define llu unsigned ll using namespace std; const int maxn=1000100; char str[maxn]; int x[maxn<<1],y[maxn<<1]...

P4980 【模板】Polya定理:  #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<map> #include<queue> #define ll long long #define llu unsigned ll using namespace std; const int mod=1000000007; const int maxn=100100; int...

一、Network POJ - 3417： 求多少条树边被非树边覆盖了零次或者一次： 注意，若一刀就能使树不连通，那么也需要第二刀去切附加边。 1号节点的 cf 不算 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<map> #include<queue> #include<set> #define ll long long #define llu u...

一、最短路必经边：先求出任意一条最短路，记录这条最短路上所有的边，枚举这些边： 题目描述 Farmer John 热衷于散步，每天早上他都要从 1 号仓库走到 n 号仓库。 Farmer John 家的 n 个仓库被 m 条双向道路连通起来，每条道路有一个长度 w。而Farmer John 又不喜欢走路，所以他走的是从 1 号仓库到 n 号仓库的最短路。 但是 Farmer 的奶牛们总想搞点事情，他们计划着把 m 条道路的其中一条变成原来长度的 2 倍，使得 Farmer John 可能会多走一点路。 他们想知道，最多能让 Farmer John 多走多少路呢？ 输入 第一行一个正整数 n,m...

参考Roadblocks POJ - 3255： 洛谷P2865 [USACO06NOV]路障Roadblocks： 一、直接Dijkstra： #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<map> #include<queue> #include<set> #define ll long long #define llu unsigned ll ...

一、P4180 【模板】严格次小生成树[BJWC2010]： 因为是严格的，维护最大值和严格次大值就好啦。 #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #include<queue> #define ll long long #define llu unsigned ll using namespace std; const int maxn=300100; const ll lnf=0x...

一、染色法，暴力染色，求解字典序最小解： HDU1814 有n对人，每对有两个，有m对相互讨厌的关系，相互讨厌的两个人不能同时出现，每对人中出现且只能出现一个，判断能否成立，若成立，输出字典序最小的解。 2-sat水题： #include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<string> #include<cmath> #include<queue> #define ll long long #de...