C++足迹
贫嘴小李子的幸福生活
这个作者很懒,什么都没留下…
展开
-
VC++ cpp-httplib
VC++ cpp-httplib。原创 2022-09-01 17:45:52 · 1022 阅读 · 0 评论 -
hdu1401双向BFS
#include <iostream>#include <queue>#include <vector>#include <set>#include <algorithm>#include <stdio.h>#include <stack>#include <map>#include <string>#include <string.h>using namespa.原创 2022-04-02 20:33:49 · 325 阅读 · 0 评论 -
linux C++常用包
yum install mysql-develcd /optwget https://tangentsoft.com/mysqlpp/releases/mysql++-3.3.0.tar.gztar -zxvf mysql++-3.3.0.tar.gzcd mysql++-3.3.0./configure --enable-thread-check --enable-disasm LDFLAGS='-pthread'makemake install原创 2021-09-17 16:14:14 · 187 阅读 · 0 评论 -
洛谷P1036
https://www.luogu.com.cn/problem/P1036#include <iostream>#include <map>#include <string.h>#include <string>#include <vector>#include <stdio.h>#include <algorithm>#include <queue>#include <set>原创 2020-10-12 17:47:30 · 272 阅读 · 1 评论 -
zoj1136
https://zoj.pintia.cn/problem-sets/91827364500/problems/91827364635#include <iostream>#include <map>#include <string.h>#include <string>#include <vector>#include <stdio.h>#include <algorithm>#include <原创 2020-10-12 15:12:05 · 174 阅读 · 0 评论 -
HDU4403
http://acm.hdu.edu.cn/showproblem.php?pid=4403#include <iostream>#include <map>#include <string.h>#include <string>#include <vector>#include <stdio.h>#include <algorithm>#include <queue>#include.原创 2020-10-09 13:51:07 · 166 阅读 · 0 评论 -
fzu2190
typedef long long LL ;const int maxn = 2008 ;LL dp[maxn] , h[maxn];int _stack[maxn] , top ;int getidx(int i){ while(top >= 0 && h[_stack[top]] >= h[i]) top-- ; _stack[++top] = i ;原创 2015-05-05 15:25:15 · 534 阅读 · 0 评论 -
hdu5536
#include <stdio.h>#include <algorithm>#include <string>#include <string.h>#include <math.h>#include <map>#include <stdlib.h>#include <iostream>using namespace std;typedef long long LL ;#define原创 2015-11-04 19:38:53 · 594 阅读 · 0 评论 -
poj 2763树链剖分
const int maxn = 100008 ;int to[maxn*2] , next[maxn*2] , head[maxn*2] , edge ;void addedge(int u , int v){ to[edge] = v ; next[edge] = head[u] ; head[u] = edge++ ; to[edge] = u ; nex原创 2015-05-08 16:43:33 · 386 阅读 · 0 评论 -
lca
hdu2586const int maxn = 40008 ;struct E{ int v , w , next ;}e[maxn * 2] ;int eid , g[maxn] ;void add(int u , int v , int w){ e[eid].v = v ; e[eid].w = w ; e[eid].nex原创 2015-05-07 10:33:04 · 360 阅读 · 0 评论 -
KM最小
hdu1853const int inf = 1000000000 ;const int maxn = 508 ;bool sx[maxn], sy[maxn] ;int match[maxn], w[maxn][maxn] ;int n , m , lx[maxn] , ly[maxn] ;//n:左集元素个数; m:右集元素个数void init (){ mems原创 2015-05-06 20:44:33 · 388 阅读 · 0 评论 -
hdu5316线段树
#include <iostream>#include <queue>#include <string>#include <string.h>#include <stdio.h>#include <stdlib.h>#include <vector>using namespace std ;typedef long long LL ;const int maxn = 100002 ;原创 2015-07-29 11:57:45 · 436 阅读 · 0 评论 -
hdu 4612
#pragma comment(linker, "/STACK:102400000,102400000")using namespace std ;typedef long long LL ;const int maxn = 200008 ;const int maxm = 2000008 ;struct E{ int v , next ; int vi原创 2015-05-05 11:10:40 · 530 阅读 · 0 评论 -
POJ 2186
const int maxn = 10008 ;const int maxm = 50008 ;struct E{ int v , next ;}e[maxm] ;int eid , g[maxn] ;void add(int u , int v){ e[eid].v = v ; e[eid].next = g[u] ; g[u] = ei原创 2015-05-05 09:57:13 · 374 阅读 · 0 评论 -
树的重心
点击打开链接const int maxn = 20008 ;std::vector g[maxn] ;int n ;int siz[maxn] , cnt[maxn] ;int ans , ansid ;void dfs(int u , int father){ siz[u] = 1 ; int s = 0 ; for(原创 2014-09-26 20:16:50 · 481 阅读 · 0 评论 -
CF191C 树链剖分
点击打开链接原创 2014-09-26 14:14:12 · 823 阅读 · 0 评论 -
FZU2082 树链剖分 对边操作
0 a b,表示更新第a条路的过路费为b,1 1 a b , 表示询问a到b最少要花多少过路费。原创 2014-09-26 13:18:05 · 551 阅读 · 0 评论 -
HDU5029 树链剖分
const int maxn = 100018 ;int n ;int siz[maxn] , top[maxn] , son[maxn] ;int dep[maxn] , tid[maxn] , fa[maxn] , rank[maxn] ;int head[maxn] , to[maxn*2] , next[maxn*2] , edge ;int tim ;vo原创 2014-09-26 10:50:03 · 522 阅读 · 0 评论 -
POJ 1733
带权并查集,传递性。原创 2014-09-25 13:04:02 · 495 阅读 · 0 评论 -
POJ 1182
const int maxn = 50008 ;int father[maxn] , relation[maxn] ;int n ;void init(){ for(int i = 1 ; i <= n ; i++){ father[i] = i ; relation[i] = 0 ;原创 2014-09-25 10:55:18 · 426 阅读 · 0 评论 -
2014 ACM/ICPC Asia Regional Guangzhou Online
1002 简单线段树const int maxn = 1000008 ;int color[maxn<<2] , sum[maxn<<2] ;void make(int l , int r , int t){ color[t] = sum[t] = 2 ; if(l == r) return ; int原创 2014-09-22 15:27:04 · 1257 阅读 · 0 评论 -
HDU 5033
单调队列。duoc原创 2014-09-22 13:10:17 · 523 阅读 · 0 评论 -
HDU 5040
本来是很好的一道题,题目描述不太清楚,导致比赛的时候死都过不了。原创 2014-09-22 10:33:03 · 486 阅读 · 0 评论 -
Ubuntu 12.04 下安装Code::Blocks
在联网情况下,在Ubuntu 12.04 下输入以下指令进行安装。1.安装基本编译环境$sudo apt-get install build-essential$sudo apt-get install gdb2.安装codeblock$sudo apt-get install codeblocks$sudo apt-get install codeblocks-dbg原创 2014-09-15 14:29:09 · 724 阅读 · 0 评论 -
2014 ACM/ICPC Asia Regional Xi'an Online 小记
1006struct state{ int a[6] ; int step ; state(){} ; state(int i , int j , int k , int b , int c , int d , int s){ a[0] = i ; a[1] = j ;原创 2014-09-15 11:07:53 · 522 阅读 · 0 评论 -
The 2014 ACM-ICPC Asia Mudanjiang Regional First Round小记
struct Edge{ int v ; int next ;}e[400008] ;int g[100008] ;bool is[100008] ;int id ;int a[100008] ;int vis[100008] ;bool can[100008] ;inline void add(int u , int v){原创 2014-09-08 13:53:23 · 480 阅读 · 0 评论 -
Regionals 2011 :: Asia - Fuzhou A - Xiangqi
Regionals 2011 :: Asia - Fuzhou A - Xiangqiconst int maxn = 12 ;vector > G , R , H , C ;int sx , sy ;bool is[maxn][maxn] ;int no(){ int ex = G[0].first ; int ey = G[0].se原创 2014-11-29 14:41:11 · 571 阅读 · 0 评论 -
hdu 4833
const int maxn = 40000 ;struct ShouRu{ int day ; int money ; void read(){ scanf("%d%d" , &day , &money) ; }}shouru[maxn] ;struct TouZi{原创 2014-11-12 11:04:38 · 607 阅读 · 0 评论 -
nextday
int monthday[13] = {0 , 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31} ;int y , m , d ;void nextday(int k){ int md ; for(int i = 1 ; i <= k ; i++){ d++ ;原创 2014-11-11 15:08:17 · 705 阅读 · 0 评论 -
HDU 4123
const int maxn = 50010 ;struct Edge{ int v , w , next ;}e[maxn*2];int id , g[maxn] ;void add(int u , int v , int w){ e[id].v = v ; e[id].w = w ; e[id].next原创 2014-10-19 09:54:37 · 523 阅读 · 0 评论 -
cf475C
在一块n*m的区域中有一块a*b的刷子,这块刷子只能向下or向右,扫过的区域为x给出一块区域,问这个区域是否可以由某块刷子刷成,如果可以输出刷子最小面积,不可以则输出-1原创 2014-10-10 08:54:44 · 488 阅读 · 0 评论 -
zoj 3800
询问【l , r】 gcd 为c的组数原创 2014-10-08 19:01:19 · 628 阅读 · 0 评论 -
rmq cf CGCDSSQ
http://codeforces.com/contest/475/problem/D 询问 (l , r) 区间gcd 为原创 2014-10-08 10:06:42 · 547 阅读 · 0 评论 -
rmq
http://codeforces.com/contest/6/problem/Econst int maxn = 100008 ;int a[maxn] , n ;int cmax[maxn][20] , cmin[maxn][20] , tlog[maxn] ;void rmqinit(){ for(int i = 1 ; i <= n ; i原创 2014-10-08 09:26:09 · 418 阅读 · 0 评论 -
HDU 2295 DLX
二分bandouble Pow2(double x){ return x * x ; }const int N = 62;const int M = 100100;struct DLX{ int U[M],D[M],L[M],R[M],C[M],X[M]; int H[N],S[N],Q[N]; int size; void remove(cons原创 2014-09-28 22:23:23 · 490 阅读 · 0 评论 -
HDU 5046 DLX
二分距离原创 2014-09-28 21:36:21 · 495 阅读 · 0 评论 -
HDU 5044
● ADD1 u v k: for nodes on the path from u to v, the value of these nodes increase by k.● ADD2 u v k: for edges on the path from u to v, the value of these edges increase by k.原创 2014-09-28 13:31:28 · 553 阅读 · 0 评论 -
poj 1845
const LL mod = 9901LL ;const int maxn = 10008 ;bool is[maxn] ;int ps ;int prime[maxn] ;void make(){ memset(is , 0 , sizeof(is)) ; ps = 0 ;原创 2014-12-13 13:29:15 · 499 阅读 · 0 评论 -
hdu2421积性函数
g(n)=∑f(d)^3 (d|n,f(n)表示n的约数个数)易证g(n)为积性函数,即(n,m)=1 g(nm)=g(n)*g(m)则 若n=p1^a1 * p2^a2 ……pj^ajg(n)=g(p1^a1)*……g(pj^aj)由定义知g(p1^a1)=1^3+……(a1+1)^3=(a1+1)^2*(a1+2)^2 /4const LL mod =原创 2014-12-13 14:12:37 · 584 阅读 · 0 评论 -
hdu 4497
how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, y, z) = L? (1, 2, 3) and (1, 3, 2) are two different solutions.typedef long long LL;const int m原创 2014-12-13 21:17:55 · 500 阅读 · 0 评论