上一页 1 2 3 4 5 6 7 8 9 10 ··· 31 下一页
摘要: Life is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unexpected people. Now our journey of 阅读全文
posted @ 2017-09-13 14:53 joeylee97 阅读(144) 评论(0) 推荐(0) 编辑
摘要: 易游戏雷火盘古校园招聘开始! 易游戏雷火盘古校园招聘开始! kiki's game Problem Description Recently kiki has nothing to do. While she is bored, an idea appears in his mind, she ju 阅读全文
posted @ 2017-09-09 10:57 joeylee97 阅读(145) 评论(0) 推荐(0) 编辑
摘要: Problem Description Recently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size o 阅读全文
posted @ 2017-09-09 10:51 joeylee97 阅读(241) 评论(0) 推荐(0) 编辑
摘要: 流stream 使用了数据视图,让你可以在比集合更高的概念上指定操作使用流,你只需要将操作的调度留给实现,例如,假设你要计算某个属性的平均值,你只需要指定数据源和属性,然后流类库会优化计算,比如使用多线程来求和,计数,合并结果1.迭代器使用了一种明确的遍历策略,同时也阻止了高效的并发执行.2.你可以 阅读全文
posted @ 2017-09-07 21:48 joeylee97 阅读(160) 评论(0) 推荐(0) 编辑
摘要: #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef... 阅读全文
posted @ 2017-09-07 12:34 joeylee97 阅读(195) 评论(0) 推荐(0) 编辑
摘要: 最小支配集: 从V中选取尽量少的点组成一个集合,让V中剩余的点都与取出来的点有边相连。 (点) 最小点覆盖: 从V中选取尽量少的点组成一个集合V1,让所有边(u,v)中要么u属于V1,要么v属于V1 (边) 最大独立集: 从V中选取尽量多的点组成一个集合,让这些点中间没有边项链,也就是说对于任何一条 阅读全文
posted @ 2017-09-07 11:13 joeylee97 阅读(598) 评论(0) 推荐(0) 编辑
摘要: Description Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital 阅读全文
posted @ 2017-09-03 15:52 joeylee97 阅读(110) 评论(0) 推荐(0) 编辑
摘要: OJ上的一些水题(可用来练手和增加自信) (poj3299,poj2159,poj2739,poj1083,poj2262,poj1503,poj3006,poj2255,poj3094)初期: 一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj21 阅读全文
posted @ 2017-09-03 11:52 joeylee97 阅读(108) 评论(0) 推荐(0) 编辑
摘要: #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long lon... 阅读全文
posted @ 2017-09-03 09:37 joeylee97 阅读(102) 评论(0) 推荐(0) 编辑
摘要: Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. 阅读全文
posted @ 2017-09-01 19:43 joeylee97 阅读(130) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 31 下一页