Griffin_0-优快云博客

原创 UOJ #35. 后缀排序(后缀数组模板题)

测试一下模板#include#includeusing namespace std;const int maxn =2e5+10;struct Suffix{ int r[maxn]; int sa[maxn],rank[maxn],height[maxn]; int t[maxn],t2[maxn],c[maxn],n,m; void init(s

2016-11-06 16:17:47 748

原创 windows下MPI环境配置(VC6.0)

MPI的全称是Message Passing Interface即标准消息传递界面，可以用于并行计算。MPI的具体实现一般采用MPICH。下面介绍如何在Windows XP系统下VC6中搭建MPI环境来编写MPI程序。本文结合网上的一些教程做了一些修改和常见问题。一.准备工作1.1 安装MPI的SDK——MPICH2。mpich2-1.4.1p1-win-ia32安装程

2016-09-07 17:59:11 2506

原创 WINDOWS下bison和flex的使用

以一个简单计算器为例mycalc.l%{#include #include "y.tab.h"intyywrap(void){ return 1;}%}%%"+" return ADD;"-" return SUB;"*" return MUL;"/" retu

2016-09-05 20:46:54 1819

原创 Github简易使用指南

设置用户信息$ git config --global user.name "test"//给自己起个用户名$ git config --global user.email "test@gmail.com"//填写自己的邮箱====================创建一个项目======================== 1. 回到github首页，点击页面右下角“New R

2016-07-12 22:15:58 675

原创 ACM算法整理(不断补充ing)

动态规划1.背包问题 (1)01背包voidZeroOnepack(int F[],int C[],int W[]){ FOR(i,1,n) DFR(v,V,C[i]) F[v]=max(F[v],F[v-C[i]]+W[i]);}//初始化时//若背包不一定装满F全初始化为0//若装满 F[0]=0 其它为-inf (2)完全背包voi

2016-04-12 17:13:12 1552

原创 hdu 2063 匈牙利算法

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#include #include using namespace std;#define Maxn 512#d

2016-04-12 17:11:55 398

原创 hdu 1498 匈牙利算法

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#include #include using namespace std;#define Maxn 128#d

2016-04-12 17:11:25 432

原创 hdu 1281 匈牙利算法

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#include #include using namespace std;#define Maxn#defin

2016-04-12 17:10:39 335

原创 hdu 1179 匈牙利算法

#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define Maxn 1024#define

2016-04-12 17:09:40 419

原创 hdu 1151 匈牙利算法

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#include #include using namespace std;#define Maxn 128#d

2016-04-12 17:08:46 387

原创 poj 2503 trie树

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#include #include #include using namespace std;#define M

2016-04-12 17:07:47 392

原创 poj 1251 trie树

#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define Maxn#define modtypedef long long ll;#define FOR(i,j,n)

2016-04-12 17:06:59 327

原创 poj 1057 trie树

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#define Maxn#define modtypedef long long ll;#define FOR(i

2016-04-12 17:06:30 502

原创 hdu 1800 trie树

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#define Maxn#define modtypedef long long ll;#define FOR(i

2016-04-12 17:05:55 336

原创 hdu 1671 trie树

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#include #include #include using namespace std;#define M

2016-04-12 17:05:17 373

原创 hdu 1257 trie树

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#define Maxn#define modtypedef long long ll;#define FOR(i

2016-04-12 17:04:46 312

原创 hdu 2222(AC自动机裸题)

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#include#define Maxn 500010#define modtypedef long long ll;#defin

2016-04-12 17:02:57 365

原创 hdu 2689 sort it(树状数组逆序数)

树状数组求逆序数，原来一直没搞明白，今天看了一遍文章讲的很清楚，下面把有关内容粘过来：对于小数据，可以直接插入树状数组，对于大数据，则需要离散化，所谓离散化，就是将100 200 300 400 500 ---> 1 2 3 4 5这里主要利用树状数组解决计数问题。首先按顺序把序列a[i]每个数插入到树状数组中，插入的内容是1，表示放了一个数到树状数组中。然后使用s

2015-12-06 00:03:48 457

原创 hdu2544最短路

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 128#define MODtypedef long long ll;#define FOR(i,j,n)

2015-11-01 14:01:33 388

原创 codeforces #328 div2

A#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn#define MODtypedef long long ll;#define FOR(i,j,n)

2015-11-01 11:19:25 508

原创 BestCoder Round #61 (div.2)

A#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 128#define MODtypedef long long ll;#define FOR(i,j

2015-11-01 11:13:50 362

原创 hdu1686 Oulipo (KMP)

#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 10050typedef long long ll;#define FOR(i,j,n) for(int i=j;i<=n;i

2015-10-23 19:29:57 371

原创 poj1845 Sumdiv 数论

求A^B的所有约数之和#include#include#include#include#includeusing namespace std;#define MOD 9901const int MAXN=10000;int prime[MAXN+1];void getPrime(){ memset(prime,0,sizeof(prime)); fo

2015-10-23 19:27:28 353

原创 hdu2838 Cow Sorting(树状数组)

树状数组求逆序对#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 100005#define MODtypedef long long ll;#

2015-10-23 19:23:21 370

原创 hdu4911 Inversion

利用归并排序的思想求逆序对#include//#include#include using namespace std;int a[100005];int left[100005], right[100005];typedef long long ll;ll ans=0;void merge(int* a, int p, int q, int r){ int

2015-10-23 19:19:26 322

原创 POJ 3122pie(二分)

#include#include#include#includeusing namespace std;double pi=acos(-1.0);double pie[10010];double sum,maxn;int main(){ int i,n,f,t,c,cnt; double l,r,m; scanf("%d",&t); while(t

2015-10-23 19:17:58 336

原创 poj3273 Monthly Expense(二分)

#includeusing namespace std;int money[100005];int n,m,low=0,high=0;bool judge(int mid){ int sum=0; int group=1; for(int i=1;i<=n;i++) { if(sum+money[i]<=mid) sum

2015-10-23 19:17:21 357

原创 poj3070 Fibonacci(矩阵快速幂)

矩阵的快速幂算法/*#includeusing namespace std;typedef unsigned long long ll;#define MOD 10000struct Mat{};ll f[2];ll fib(int n){ //int f[2]; f[1]=0;f[2]=1; for(int i=2;i<=n;i++

2015-10-23 19:15:39 290

原创基于递归下降分析法自制计算器

//main.cpp#include #include #include "token.h"#include "lexicalanalyzer.cpp"#define LINE_BUF_SIZE (1024)static Token st_look_ahead_token;static int st_look_ahead_token_exists;static voidmy_g

2015-10-23 19:11:03 1373

原创 HDU 1541 Stars 树状数组

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 15233#define Maxx 32333#define MODtypedef long long l

2015-10-13 23:05:27 399

原创 poj3264 Balanced Lineup(RMQ +st)

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 50005#define MODtypedef long long ll;#define FOR(i,j,

2015-10-11 21:30:33 481

原创 hdu1856 More is better 并查集

#include#include#define Maxn 10000005int father[Maxn],num[Maxn];void init(){ for(int i=1;i<=Maxn;i++) { father[i]=i; num[i]=1; }}int getf(int x){ if(x!=father[x])

2015-10-08 20:20:13 405

原创 hdu1272 小希的迷宫并查集

#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 100005typedef long long ll;#define rep(i,j,n) for(int i=j;i<=n;

2015-10-08 18:29:23 357

原创 hdu1213 How Many Tables 并查集

#include#include#define Maxn 1024int father[Maxn];void init(int n){ for(int i=1;i<=n;i++) father[i]=i;}int getf(int x){ if(x!=father[x]) father[x]=getf(father[x]); return fathe

2015-10-08 17:32:10 367

原创 RMQ Codeforces Round #322 (Div. 2) B. Luxurious Houses

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 222222#define MODtypedef long long ll;#define FOR(i,j

2015-09-28 22:01:42 403

原创 2015 ACM/ICPC Asia Regional Changchun Online hdu5444

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define N 1010#define MODtypedef long long ll;#define FOR(i,j,n) f

2015-09-21 17:10:31 362

原创 2014 ACM/ICPC Asia Regional Beijing Online Grade hdu5038

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 100050#define MODtypedef long long ll;#define FOR(i,j

2015-09-21 17:04:09 401

原创 2015 ACM/ICPC Asia Regional Changchun Online-1007The Water Problem(线段树裸题)

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 1024#define MODtypedef long long ll;#define FOR(i,j,n

2015-09-14 21:11:50 478

原创 pku1423 Big Number(Stirling公式)

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn#define MODtypedef long long ll;#define FOR(i,j,n) for

2015-09-14 19:01:56 510

原创 hdu1166-敌兵布阵(线段树)

#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 55555#define MODtypedef long long ll;#define FOR(i,j,

2015-08-28 10:29:43 350

空空如也

空空如也