« 博客园首页

线段树(segment tree)

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...0,22000,30300,44000,55000,60000 1, 2, 3, 4, 5, 6
null00 2012-04-22 推荐(9) 评论(7) 浏览(28164)
http://www.cnblogs.com/null00/archive/2012/04/22/2464583.html

线段树

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...0,22000,30300,44000,55000,60000 1, 2, 3, 4, 5, 6
山路水桥 2012-08-31 浏览(33)
http://www.cnblogs.com/10jschen/archive/2012/08/31/2665864.html

线段树(转)

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...cnblogs.com/shuaiwhu/archive/2012/04/22/2464583.html 线段树在一些acm题目中经常见到,这种数据结构主要
依蓝jslee 2013-11-27 浏览(18)
http://www.cnblogs.com/jslee/p/3445200.html

线段数【转】

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...cnblogs.com/shuaiwhu/archive/2012/04/22/2464583.html 学习算法,自己收藏一下。 线段树(segment tr
ediszhao 2014-09-20 浏览(39)
http://www.cnblogs.com/ediszhao/p/3983491.html

线段树(转)

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...0,22000,30300,44000,55000,60000 1, 2, 3, 4, 5, 6
敲敲代码,打打酱油 2015-08-05 浏览(21)
http://www.cnblogs.com/dxd-success/p/4704034.html

51nod 1455 宝石猎人(dp or 记忆化搜索)

int dp[30300][550], vis[30300]; int main() { int n, d; while(cin>>n>>d)... int dp[30300][550], vis[30300]; int d; int dfs(int now, int p) { if(now>300
spek 2016-05-09 浏览(2)
http://www.cnblogs.com/shenpuvip/p/5518075.html

线段树(segment tree)

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...0,22000,30300,44000,55000,60000 1, 2, 3, 4, 5, 6
比特飞流 2016-06-04 浏览(15)
http://www.cnblogs.com/bytebull/p/5558300.html

【转】线段树(segment tree)

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...0,22000,30300,44000,55000,60000 1, 2, 3, 4, 5, 6
何解一直犯相同错误? 2012-07-09 浏览(26)
http://www.cnblogs.com/lzhitian/archive/2012/07/09/2582751.html

linux shell 命令学习(5) xxd- make a hexdump or do the reverse.

43d3430 30300d0a itercount=4000.. -i:将文件内容输出成 c的一个数组格式 [work@cq02-.com src...rk@cq02.com src]$ xxd -b train.ini 0000000: 01011011 01110100 01110010 01100001
一颗麦粒 2014-05-05 浏览(1818)
http://www.cnblogs.com/kwliu/p/3709707.html

[转]SQLite数据库与其它一些数据库的性能比较

.sqlite.com.cn/MySqlite/6/22.Html SQLite数据库与其它一些数据库的性能比较 ...joycode.com/fish/archive/2004/08/13/30653.aspx MySQL(My
hyke 2007-06-19 浏览(2329)
http://www.cnblogs.com/yelsea/archive/2007/06/19/789805.html

0-1背包的总结

ion(s): 30300 Accepted Submission(s): 12477 Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. Thi
我喜欢旅行 2014-08-27 浏览(16)
http://www.cnblogs.com/yspworld/p/3939692.html

hdu3333(线段树)

efine N 30300 #define SN 300300 struct node { int x,y; int key; int id; }line[N*10]; map<int,int>cao; __int64 sum[N]; __int64 ans[100100]; int l[SN
chenhuan001 2014-11-06 浏览(15)
http://www.cnblogs.com/chenhuan001/p/4080121.html

【ACM】hud1166 敌兵布阵(线段树)

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...cnblogs.com/shuaiwhu/archive/2012/04/22/2464583.html 作者Microgoogle 线段树在一些acm题目中经
匡子语 2014-11-13 浏览(35)
http://www.cnblogs.com/dplearning/p/4095888.html

线段树

000] [30300,55000] [44000,60000] [55000,60000] 排序得10000,22000,30300,44000,...cnblogs.com/superbin/archive/2010/08/02/1790467.html 线段树(interval tree) 是把区间逐次
踮起脚望天 2016-07-19 浏览(14)
http://www.cnblogs.com/lbyj/p/5685993.html

ACM-线段树

22000],[30300,55000],[44000,60000],[55000,60000]. 第一步:排序 10000 22000 30300 44000...~[1,2] [30300,55000]~[3,5] [44000,60000]~[4,6] [55000,60000]~[5,6] 然后再用小数进行普通解法的
qlky 2016-07-21 浏览(24)
http://www.cnblogs.com/qlky/p/5690265.html