刷题
白小白啊黑小黑
这个作者很懒,什么都没留下…
展开
-
POJ 2299 树状数组求逆序对
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;``int tree[500005]={0};int n;struct ha{ long long val,pai;};int lowbi...原创 2019-04-10 19:47:31 · 110 阅读 · 0 评论 -
POJ 1182 (种类并查集)
#include<queue>#include<algorithm>#include<cstdio>#include<iostream>#include<string.h>#include<vector>using namespace std;const int maxn=1500050;const int I...原创 2019-05-07 21:41:45 · 77 阅读 · 0 评论 -
POJ 3468 (线段树)
#include<algorithm>#include<iostream>#include<cstdio>#include<string.h>using namespace std;const long long maxn=100010;struct node{ long long lazy,sum; long l...原创 2019-05-15 14:24:45 · 130 阅读 · 0 评论 -
KMP(第一次匹配的首位置)
#include<iostream>#include<algorithm>#include<cstdio>#include<string.h>using namespace std;const int maxn=1e6+5;int s[maxn];int p[maxn];int nex[maxn];int getnext(int m...原创 2019-05-20 20:09:05 · 241 阅读 · 0 评论 -
最远距离
///从任意一点搜,再从最远点搜,得到结果。#include<iostream>#include<algorithm>#include<cstdio>#include<queue>#include<string.h>#include<vector>using namespace std;const int in...原创 2019-05-20 21:35:27 · 108 阅读 · 0 评论 -
甜咸之争(模拟)
Description自古以来,豆腐脑到底吃甜的(甜党)还是吃咸的(咸党)的党派战争从未停息,现在是公元9012年,甜咸两党终于进行了最终的决战,粉碎异端。但是9012年是个和平的时代,不允许发动战争。所以,这次决战将以团体辩论的方式进行。他们站成一列,依次进行发言,最后一个人发言完毕后又会回到第一个人发言,直到一方的代表人物全部出局为止。每次发言的人可以选择直接让另一个人出局,如果轮到了一个被...原创 2019-05-21 16:18:25 · 293 阅读 · 0 评论 -
求斐波那契数列F[a]和F[b]的最大公因数
#include<bits/stdc++.h>using namespace std;typedef long long ll;const int MOD=100000000;struct mat{ ll a[2][2];};mat mat_mul(mat x,mat y){ mat res; memset(res.a,0,sizeof(res...原创 2019-05-21 21:32:30 · 629 阅读 · 0 评论 -
HDU 1166 (线段树)
#include<iostream>#include<algorithm>#include<queue>#include<cstdio>using namespace std;int number[50001];struct node{ int l,r,sum;}p[800000];void build(int k,int...原创 2019-05-12 20:09:41 · 76 阅读 · 0 评论 -
POJ 3268 ( Dijkstra )
#include<iostream>#include<algorithm>#include<cstdio>#include<queue>#include<string.h>#include<vector>using namespace std;const int inf=0x3f3f3f3f;struct no...原创 2019-05-06 20:41:28 · 124 阅读 · 0 评论 -
HDU 1754 (线段树)
#include<iostream>#include<algorithm>#include<cstdio>using namespace std;const int maxn=500004;int number[maxn];int ans=-100;struct node{ int l,r,big;};node a[1000000];...原创 2019-05-13 20:10:57 · 75 阅读 · 0 评论 -
POJ 3984 (BFS+路径保存)
#include<iostream>#include<algorithm>#include<string.h>#include<stack>#include<cstdio>#include<queue>using namespace std;int a[6][6];int next[4][2]= {{0,1},...原创 2019-04-25 19:52:03 · 196 阅读 · 1 评论 -
POJ 2387 (Dijkstra)
#include<vector>#include<iostream>#include<algorithm>#include<queue>#include<cstdio>#include<string.h>using namespace std;const int INF=0x3f3f3f3f;const int...原创 2019-04-28 10:11:37 · 105 阅读 · 0 评论 -
POJ 2251 三维BFS
#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<queue>#include<string.h>#include<map>#include<math.h>using namespa...原创 2019-04-23 17:25:15 · 114 阅读 · 0 评论 -
POJ 1797 (dijkstra变形)
#include<queue>#include<algorithm>#include<cstdio>#include<iostream>#include<string.h>#include<vector>using namespace std;const int maxn=1001;const int INF=...原创 2019-04-28 17:54:44 · 161 阅读 · 0 评论 -
POJ 2236 (并查集)
#include<queue>#include<algorithm>#include<cstdio>#include<iostream>#include<string.h>#include<vector>using namespace std;const int maxn=1001;const int INF=...原创 2019-04-28 19:49:58 · 140 阅读 · 0 评论 -
POJ 3278 (BFS)
#include<iostream>#include<algorithm>#include<queue>#include<string>#include<string.h>#include<map>using namespace std;map<int,int >aa;bool vis[600000...原创 2019-04-24 20:16:03 · 136 阅读 · 0 评论 -
HDU 1272 (并查集判断是否有环)
#include<iostream>#include<cstdio>#include<algorithm>#include<queue>#include<set>#include<string>using namespace std;const int maxn=1e5+5;int p[maxn];set&l...原创 2019-05-08 14:27:24 · 134 阅读 · 0 评论 -
POJ 2528 (线段树+离散化)
#include<string.h>#include<iostream>#include<algorithm>using namespace std;const int maxn=20005;int pl[maxn],pr[maxn],n;int col[maxn*8];int vis[maxn]= {0};int ans=0;int id[m...原创 2019-07-25 14:00:54 · 90 阅读 · 0 评论