算法模板
关注
分享
扫一扫
文章平均质量分 81
丿Smile灬晨星
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Codeforces587C（倍增LCA）
参考代码：#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long lon原创 2015-10-16 13:47:19 · 1401 阅读 · 0 评论 -
欧拉函数 素数线性筛法模板
const int PN = 1000000;int phi[PN+10], prime[PN+10], tot;bool isPrime[PN+10];void getPhiPrime(){ phi[1]=1; isPrime[1] = false; for(int i=2; i<=PN; i++) //相当于分解质因式的逆过程 { if(原创 2016-04-10 14:14:50 · 765 阅读 · 0 评论 -
MillerRabin质数判定+PollardRho质因子分解
参考 matrix67，kuangbin blog测试 POJ1811#include#include#include#include#include#include#includeusing namespace std;typedef long long LL;#define maxn 10000/************************原创 2016-04-10 17:02:17 · 635 阅读 · 0 评论 -
高斯消元解异或方程组 模板
Code：struct matrix{ const int RNS = 55; const int CNS = 55; int row, col; int a[RNS][CNS], b[RNS]; void init(int _row, int _col) { row = _row, col = _col; me原创 2016-03-20 23:28:03 · 1491 阅读 · 0 评论 -
最大流SAP模板
CF653D 题目链接 Code:#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#i原创 2016-03-19 20:01:38 · 489 阅读 · 0 评论 -
Codeforces621E 矩阵构造快速幂
矩阵连乘原创 2016-02-01 13:12:52 · 846 阅读 · 0 评论 -
Leetcode Best Time to Buy and Sell Stock IV(最大子段和)
贪心、最大子段和原创 2016-01-12 17:13:26 · 558 阅读 · 0 评论 -
hdu2203（KMP模板）
参考代码：#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long lon原创 2015-10-10 01:09:47 · 540 阅读 · 0 评论 -
原地归并实现
/**原地归并*/void swap(int* vals, int x, int y){ vals[x] ^= vals[y]; vals[y] ^= vals[x]; vals[x] ^= vals[y];}void reverse(int* vals, int x, int y){ while(x < y) { swap(原创 2015-12-06 00:09:39 · 688 阅读 · 0 评论 -
Codeforces598C（极角排序）
先占坑ACcode：//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;原创 2015-11-15 21:30:21 · 996 阅读 · 0 评论 -
zoj3903-数学公式(快速幂除法逆元组合数模板)
参考代码:#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long lon原创 2015-10-11 17:26:41 · 1203 阅读 · 2 评论 -
hdu3966(树连剖分模板-节点价值建树)
裸的树连剖分，做成模板写的ACcode:#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;原创 2015-09-29 23:13:36 · 419 阅读 · 0 评论 -
hdu5497(树状数组模板)
用两个树状数组维护前缀后缀的值即可，必须离散化，否则TLE参考代码：#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#includeusi原创 2015-10-03 21:39:24 · 820 阅读 · 0 评论 -
大数模版
#include #include #include #include #include #include using namespace std;const int MAXN = 500;struct bign{ int len, s[MAXN]; bign () { memset(s, 0, sizeof(s)); len = 1; } bign (in原创 2013-02-25 00:24:59 · 575 阅读 · 0 评论