ACM
coder神农
专注linux、c/c++、网络编程、算法
===
现改行java中间件开发....
展开
-
ZOJ1011 NAT
NTATime Limit: 2 Seconds Memory Limit: 65536 KB The NTA (Non-deterministic Tree Automata) is a kind of tree structure device. The device is built in a set of operating rules. With the原创 2012-10-13 00:58:45 · 682 阅读 · 0 评论 -
ZOJ1004 Anagrams by Stack
Anagrams by StackTime Limit: 2 Seconds Memory Limit: 65536 KB How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert原创 2012-10-13 00:51:31 · 765 阅读 · 0 评论 -
ZOJ 1097 CODE the Tree
Code the TreeTime Limit: 2 Seconds Memory Limit: 65536 KB A tree (i.e. a connected graph without cycles) with vertices numbered by the integers1, 2, ..., n is given. The "Prufer" code原创 2012-10-13 12:59:06 · 876 阅读 · 0 评论 -
cdoj 1221_uestc
POJ 2823 单调队列的入门题!非常给力,少有的1Y! 2011-08-22 20:29:55| 分类:数据结构 |字号 订阅转载:http://welcomechengyao.blog.163.com/blog/static/185469890201172281217260/ 今天下午我可是好好的看了一下单调队列啊!刚开始看的时候不是很转载 2013-03-23 20:49:45 · 940 阅读 · 0 评论 -
《算法竞赛入门经典》之语言篇总结
1.Floor(number):函数返回number的整数部分。开方【number=sqrt(x)】后,再floor(number+1)可防止浮 点运算的误差。2.重定向用于测试数据 (c语言) freopen(“input.txt”,”r”,stdin); freopen(“output.txt”,”w”,stdout); (c原创 2012-09-12 16:45:17 · 574 阅读 · 0 评论