|
|||
|
摘要：
Flood Fill translate by MDK 2011.11.22 18:51 这篇文章说的应该就是很有名的种子填充法。 Sample Problem: Connected Fields Farmer John's fields are broken into fields, with paths between some of them. Unfortunately, ... 阅读全文
posted @ 2011-11-22 19:25 MDeath-Kid 阅读(361) 评论(0) 推荐(0) 编辑
摘要：
translate by MDK 2011.11.22 14:49Graph Theory What's a Graph? 什么是图论？ Formally, a graph is the following: a collection of vertices V, and a collection of edges E consisting of pairs of vertices. T... 阅读全文
posted @ 2011-11-22 18:49 MDeath-Kid 阅读(431) 评论(0) 推荐(0) 编辑
摘要：
PROB Number Triangles [ANALYSIS] ----- 简单DP// solution 1 DPint dp[MAXN][MAXN],n;int a[MAXN][MAXN];int main(){ FOPENTI FOPENTO SET(dp,0);SCF(n); F(i,n) F(j,i+1){ SCF(a[i][j]); } for(int k = 0;k<n;k++)... 阅读全文
posted @ 2011-11-21 21:18 MDeath-Kid 阅读(207) 评论(0) 推荐(0) 编辑
摘要：
translate by MDK –11.11.21 9:23Binary Numbers Representing Binary Numbers Computers operate on 1's and 0's; these are called 'bits'. A byte is a group of 8 bits, like this: 00110101. A computer word... 阅读全文
posted @ 2011-11-21 09:36 MDeath-Kid 阅读(286) 评论(0) 推荐(0) 编辑
摘要：
PROB Packing Rectangles [ANALYSIS]----第一题是3天前看到的，事隔一课考试，全校答辩，今天终于A出来了，每天都在想，都在想，终于对这个题目比较明白了。/* solution 1 1 枚举排列数 2 枚举翻转 3 按6种情况枚举最小的 4 所有情况记录所有最小值*/int rectx[4],recty[4];int meijux[4],meijuy[4];bool... 阅读全文
posted @ 2011-11-21 09:23 MDeath-Kid 阅读(440) 评论(0) 推荐(0) 编辑
摘要：
几句话道出map和hash_map的区别1. STL map is an associative array where keys are stored in sorted order using balanced trees. While hash_map is a hashed associated container, where keys are not stored in an ordered way. Key, value pair is stored using a hashed function. 2. Insertion and lookup takes Ologn time 阅读全文
posted @ 2011-11-20 19:54 MDeath-Kid 阅读(274) 评论(0) 推荐(0) 编辑
摘要：
立项终于完事，累屎人了，11.18好下午全校答辩，做得还行吧，到这发现没话说了。。。 两个项目：车牌识别，蓝牙个域网，凑合着通过了，400元项目资金，真寒酸，不知道等到什么时候钱才能给！USACO因此耽搁了三天（答辩前一天考试，周四，周五，周六三天。。。我在计算什么？）。 上午在找ocean这个电影，发现基地的网速根本缓冲不了。无奈这个马上就要拆的楼房，不知道下学期去那，真希望学校能够在给分一个地... 阅读全文
posted @ 2011-11-19 18:40 MDeath-Kid 阅读(262) 评论(0) 推荐(0) 编辑
摘要：
少优化->多优化： O0 -->> O1 -->> O2 -->> O3 -O0表示没有优化,-O1为缺省值，-O3优化级别最高 英文解析： `-O ' `-O1 ' Optimize. Optimizing compilation takes somewhat more time, and a lot more memory for a large function. With `-O ', the compiler tries to reduce code size and execution time, without p 阅读全文
posted @ 2011-11-17 22:01 MDeath-Kid 阅读(1542) 评论(0) 推荐(0) 编辑
摘要：
译文 by MDK on 2011.11.16 8:28Search Techniques 搜索技术 Sample Problem: n Queens [Traditional] Place n queens on an n x n chess board so that no queen is attacked by another queen. 例子:n 皇后问题 把n个皇后放在 n * ... 阅读全文
posted @ 2011-11-16 10:16 MDeath-Kid 阅读(346) 评论(0) 推荐(0) 编辑
摘要：
PROB Mixing Milk [ANALYSIS] ---- 最常见的一种贪心了吧，没啥好说的。analysis 里面：//很是犀利的想法for(i=0;i<M;i++) { fscanf(in, "%d %d", &(price), &(amount)); amount_for_price[price]+=amount;}PROB Barn Repair [ANALYSIS] ---- 贪心，有最大的木板就一块的时候进行倒推。priority_queue<int> Q;int M,S,C;int a[MAXN]={0};int mai 阅读全文
posted @ 2011-11-16 08:20 MDeath-Kid 阅读(167) 评论(0) 推荐(0) 编辑 |
|||
