2017年03月_河渔船

原创 P2709 小B的询问（莫队）

https://www.luogu.org/problem/show?pid=2709#sub莫队经典题#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int n,m,k,sum=0;int num[50009],a[5000

2017-03-31 14:53:26 447

原创矩阵乘法（菲波那切数）

#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>using namespace std;int A[3][3]={0,0,0, 0,1,1, 0,1,0,};int key[3][3],n,bak[3][3];void pow_A_key(int x){

2017-03-29 15:36:57 286

原创 P1972 [SDOI2009] HH的项链（莫队）

https://www.luogu.org/problem/show?pid=1972#sub#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cmath>using namespace std;struct H{ int l,r,id,qv;}Q[200009];in

2017-03-29 14:41:48 401

原创矩阵乘法（别人的blog）

http://www.ruanyifeng.com/blog/2015/09/matrix-multiplication.html

2017-03-29 14:27:57 525

原创 P1101 单词方阵

https://www.luogu.org/problem/show?pid=1101#sub#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<algorithm>#include<queue>#include<vector>using namespace std;int dx[]=

2017-03-26 10:01:19 882

原创关系运算图（差分约束）

https://www.vijos.org/p/1094差分约束：用<=来构图（遵循向量的性质），找最小值，用最长路一开始全部入队（假定图联通），然后用spfa来跑最长路#include<iostream>#include<cstdio>#include<cstring> #include<string>#include<algorithm>#include<vector>#in

2017-03-24 15:39:54 334

原创 P1605 迷宫

https://www.luogu.org/problem/show?pid=1605#subdfs#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<algorithm>#include<queue>#include<vector>using namespace std;int an

2017-03-19 11:32:41 1019

原创 P3388 【模板】割点

https://www.luogu.org/problem/show?pid=3388#sub#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<algorithm>#include<queue>#include<vector>using namespace std;int dfn[1

2017-03-19 10:05:42 345

原创割点（模板）

#include<iostream>#include<cstring>#include<cstdio>#include<string>#include<algorithm>#include<queue>#include<vector>using namespace std;int dfn[1001],low[1001],dfs_num=0,n,m,cnt=0,root;int nu

2017-03-19 09:58:11 301

原创 P1339 热浪

https://www.luogu.org/problem/show?pid=1339Dijkstra最短路#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<queue>#include<vector>#include<algorithm>using namespace std;in

2017-03-17 17:22:02 482

原创 P1801 黑匣子（对顶堆）

https://www.luogu.org/problem/show?pid=1801#sub用对顶堆来做：上次输出第s小的数，在大根堆里储存s数（这个状态需要维护），在小根堆里存剩下的数，下一次输出时输出小根堆的顶，即是需要输出的值，s++#include<iostream>#include<cstdio>#include<cstring>#include<string>#includ

2017-03-17 16:28:49 440

原创 P1208 混合牛奶

#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include<cstdio> using namespace std;int n,m,ans=0;struct H{ int p,a;}milk[5009];int

2017-03-17 15:12:41 390

原创 P1204 挤牛奶

https://www.luogu.org/record/lists?pid=P1204维护区间#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include<cstdio> using namespace std;int n,m

2017-03-17 15:05:59 392

原创 P1206 回文平方数

https://www.luogu.org/problem/show?pid=1206#sub#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include<cstdio> using namespace std;int B,a[

2017-03-15 18:04:56 415

原创 P1209 修理牛棚

https://www.luogu.org/problem/show?pid=1209贪心：先把连着的牛们用板连起来（相连的几头牛称为），如果块数>m，则需要连板，显然把牛群中间相隔最短的连起来，长度就需要加上补上的这块。#include<iostream>//减板 #include<cstring>#include<string>#include<algorithm>#include<

2017-03-14 19:03:22 429

原创 P1203 坏项链

https://www.luogu.org/problem/lists?name=1203&orderitem=pid&tag=此题最恶心的是头与尾的处理！我竟然。#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include<cst

2017-03-14 18:55:54 218

原创 P1726 上白泽慧音

luogu——————解法：一个绝对连通区域就是一个强连通分量因为题目要求输出最大强连通分量的规模，所以不需要考虑重边的问题（即会出现大包小的情况），如果要输出教学区的个数，则需要减去此种情况#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<ve

2017-03-10 14:26:53 311

原创 P2341 受欢迎的牛

luogu ——————思路和爱在心中差不多爱在心中#include<iostream>#include<cstdio>#include<cstring>#include<string> #include<algorithm>#include<queue>#include<vector>using namespace std;int num[50009],he

2017-03-10 14:17:41 584

原创 P1396 营救

luogu 解法：Kruskal最小生成树；在构建最小生成树时，如果 s 与 t 在一个集合里时，当前边就是答案（因为便是按照升序排的）#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<vec

2017-03-08 18:34:29 549

原创 P3379 LCA(模板)

luogu#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<vector>#define NN 500000using namespace std;int n,m,s;//vector <int> a[NN+2]

2017-03-08 15:43:31 234

原创 P1265 公路修建

洛谷 1265#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<vector>#define pow1(x) (x)*(x)using namespace std;int n;double zx[5009],zy

2017-03-08 15:31:03 524

原创 P1576 最小花费

luogu 1576错误：第31行 maxd 类型为double，赋成int！解法：把消耗转化为剩余，运用最短路算法dijstra来找一遍最长路#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include<cstdio>

2017-03-08 15:01:15 993

原创 P1522 牛的旅行

洛谷此题。调了2+小时。。终其原因： 1、pow1（x）（x）*（x）！ 2、memset（127）可能比 1e10 小 exin 至极，铭记！#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>#include

2017-03-05 10:31:32 717

原创 P2731 骑马修栅栏

洛谷课本Page 466定理1：存在欧拉路的条件，图是连通的，有且只有 2 个奇点；定理2：存在欧拉回路的条件，图是连通的，有 0 个奇点；#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<cmath>#include<queue>#include<vector>#inclu

2017-03-03 17:21:48 343

原创 P1330 封锁阳光大学

luogu坑：图可能分为多个连通块，对于每个连通块都要找染色个数较小的那种颜色，sum进ans#include<iostream>//对于每一块连通分量都应该能够分为二分图才能够封锁全部的道路，否则Impossible #include<cstring>#include<string>#include<algorithm>#include<queue>#include<vector>

2017-03-03 15:53:47 395

原创 1022 舞会2

vijos#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#include<queue>using namespace std;vector <int> a[202];int n,m,dfs_num=0,dfn[202],low[

2017-03-01 15:53:50 339

原创 1626 爱在心中

vijos描述“每个人都拥有一个梦，即使彼此不相同，能够与你分享，无论失败成功都会感动。爱因为在心中，平凡而不平庸，世界就像迷宫，却又让我们此刻相逢Our Home。” 在爱的国度里有N个人，在他们的心中都有着一个爱的名单，上面记载着他所爱的人（不会出现自爱的情况）。爱是具有传递性的，即如果A爱B，B爱C，则A也爱C。如果有这样一部分人，他们彼此都相爱，则他们就超越了一切的限制，用集体的爱化身

2017-03-01 15:49:14 1567

hjx