« 博客园首页

POJ 1201 Intervals

w; } qu[50006]; int num[50006]; int main() { int n; while(scanf("%d",&n)!=EOF) { int i,s=1<<30,e=0; for(i=0; i<n; i++) {
、小呆 2013-10-14 浏览(3)
http://www.cnblogs.com/lin375691011/p/3996732.html

数据库设计

VALUES(50006,'Oracle数据库') ; INSERT INTO course(cid,cname) VALUES(50008,'Android...S (1001,50006) ; INSERT INTO teacher_course(tid,cid) VALUES (1002,50008) ; -- 增加
随时变脸的世界 2016-08-24 浏览(3)
http://www.cnblogs.com/doudouxiaoye/p/5804050.html

Windows下DB2端口查看/修改/分配

INST 50006/tcp 2. 分配端口: db2 UPDATE DBM CFG USING SVCENAME db2c_MYINST 参考: DB2 Instance实例 的创建 http://topic.csdn.net/t/20030704/12/1990179.html
cree 2013-03-14 浏览(76)
http://www.cnblogs.com/cree/archive/2013/03/14/2959196.html

DreamWeaver序列号和Dreamweaver CS4序列号以及Dreamweaver CS5 序列号

、WPD700-50006-04894-828163、WPD700-54808-85794-705214、WPD700-51701-14294-380255、WPD700-51109-38394-177866、WSD700-54620-41863-180768、WPD700-52406-21894-180769、WPD
沉默的稻草人 2012-06-02 浏览(680)
http://www.cnblogs.com/W-Scarecrow/archive/2012/06/02/2531586.html

WebLoad 解析服务器返回的XML格式内容

.41.111:50006_1dbe4f42-acb3-ae47-9008-936faf1b0679</message>   </status></res> var contents = document.wlSource; var xmlObject = new XMLParserObject() var do
tomweng 2014-12-26 浏览(18)
http://www.cnblogs.com/tomweng/p/4186228.html

主席树模板

int M = 50006; int w[M], a[M], root[M]; struct Tree{ int ls, rs, w; } tr[M << 4] ; int tot ; void insert(int &x, int l, int r, int d){ tr[++tot] = tr[
acmood 2015-04-22 浏览(47)
http://www.cnblogs.com/acmood/p/4449037.html

uoj #148. 【NOIP2015】跳石头 二分

; int a[50006], n, m; int check(int x) { int pre = 0, sum = 0; for(int i = 1; i<=n; i++) { if(a[i]-pre<x) { sum++; } else {
yohaha 2016-02-21 浏览(93)
http://www.cnblogs.com/yohaha/p/5204495.html

poj 3685 Matrix(二分搜索之查找第k大的值)

efine N 50006 11 ll n,m; 12 ll cal(ll i,ll j){ 13 return i*i+100000*i+j*j-10...efine N 50006 11 ll n,m; 12 ll cal(ll i,ll j){ 13 return i*i+100000*i+j*j-10
uniquecolor 2015-09-04 浏览(32)
http://www.cnblogs.com/UniqueColor/p/4782278.html

POJ---2524 Ubiquitous Religions[简单并查集]

ne MAXN 50006 22 23 int father[MAXN]; 24 int n,m; 25 26 void makeset() 27 { 28 for(int i=0;i<MAXN;i++) 29 father[i]=i; 30 } 31 32 int findset(int
xbwer 2012-08-09 浏览(30)
http://www.cnblogs.com/XBWer/archive/2012/08/09/2629848.html

HDU 3072 Intelligence System(强连通分量)

t int N=50006; 9 10 struct Edge 11 { 12 int u, val, next; 13 Edge() {} 14 Edge(int a, int b, int c) 15 { 16 u=a, val=b, next=c; 17
jianzhang.zj 2013-03-17 浏览(425)
http://www.cnblogs.com/zhj5chengfeng/archive/2013/03/17/2964052.html

HDU 2767 Proving Equivalences(强连通分量)

} edge[50006]; 17 int head[20006], tot; 18 int dfn[20006], low[20006], T, in[20006]; 19 int id[20006], ind; 20 stack<int> S; 21 int t, n, m; 22 23 void add_ed
jianzhang.zj 2013-03-17 浏览(59)
http://www.cnblogs.com/zhj5chengfeng/archive/2013/03/17/2964065.html

HDU 3874 Necklace(树状数组+离线处理)

t int N=50006; 10 11 struct Node 12 { 13 int L, R, id; 14 inline void init(int a, int b, int c) 15 { 16 L=a, R=b, id=c; 17 } 18 19
jianzhang.zj 2013-04-25 浏览(73)
http://www.cnblogs.com/zhj5chengfeng/archive/2013/04/25/3042291.html

hdu 3072

efine N 50006 6 using namespace std; 7 8 struct Edge 9 { 10 int u, val, next; 11 Edge() {} 12 Edge(int a, int b, int c) 13 { 14 u=a
yours1103 2013-09-04 浏览(62)
http://www.cnblogs.com/yours1103/p/3301907.html

线段数Hdu1166

efine N 50006 struct data { int l; int r; int sum; ///节点附加信息 此题为求和。。。 } node[N<<2]; int num[N],s; void build(int l,int r,int rt) { node[rt].l=
点点滴滴” 2014-03-18 浏览(6)
http://www.cnblogs.com/zhangying/p/3608671.html

IOI Railway 分类: ioi 2015-03-30 22:29 34人阅读 评论(0) 收藏

MAXN = 50006,MAXM = 10000005; int f0 = 0, f1 = 0; int d0[MAXN] = {0},d1[MAXN] = {0}; struct station { int dis,num; station(int dis = 0,int num = 0):d
&lt;dash&gt; 2015-03-30 浏览(14)
http://www.cnblogs.com/dashgua/p/4723064.html