上一页 1 ··· 99 100 101 102 103
摘要: Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45024Accepted Submission(s): 15983Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time 阅读全文
posted @ 2012-09-19 15:33 xingoo 阅读(497) 评论(0) 推荐(0) 编辑
摘要: Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 85953Accepted Submission(s): 19912Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max 阅读全文
posted @ 2012-09-19 15:32 xingoo 阅读(510) 评论(0) 推荐(0) 编辑
摘要: A + B Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 124589Accepted Submission(s): 23993Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of 阅读全文
posted @ 2012-09-19 15:31 xingoo 阅读(296) 评论(0) 推荐(0) 编辑
摘要: 那一年我们研一,面对本科那些孩子们突然感觉自己已经很老了,却还在犯着很幼稚的错误。那一年我们研一,却发现曾经挑灯夜读为之奋斗的梦在慢慢破灭,这不是我们想要的生活。那一年我们研一,整天顶着高学历的帽子招摇过市的我们其实知道的真的很少。那一年我们研一,本科时得过且过的心态还未散尽却发现其实毕业离我们真的不远了。那一年我们研一,看多了身边太多的合合分分,不再相信感情的坚实,却依然带着几分希冀期盼着什么… …那一年我们研一,偶尔看到大一大二的孩子们,突然感觉他们好小啊,也默默地想像着:如果再来一次我的大学会怎么过呢?但最后还是苦笑了一下继续自己纠结的课题。那一年我们研一,突然怀念本科老师能把一个个知识 阅读全文
posted @ 2012-09-19 15:22 xingoo 阅读(687) 评论(2) 推荐(5) 编辑
摘要: 程序特性规定:1 程序开始执行时,自认为一切变元的值为02 转向无定义符号,执行程序的最后一条指令 时 自动认为停机y=x+3y=x+1y=x+1y=x+1y=xn(x)=0x=x+1y=x1+x2y=x1[B] TO A IF x2 !=0 TO E[A] x2 = x2 -1 y=y+1 TO By=2xTO C IF x!=0TO E[C] TO A IF x!=0[B] y=y+1 z=z-1 TO B IF z!=0 TO E[A]x=x-1 y=y+1 z=z+1 TO Cy=x1*x2[B]TO A IF x2 != 0 TO E[... 阅读全文
posted @ 2012-09-18 23:24 xingoo 阅读(239) 评论(0) 推荐(0) 编辑
摘要: 将新的节点插入双向链表的时候:iterator insert(iterator itr,const Object & x)//向双向链表中插入一个x节点{ Node *p = itr.current; theSize++; return iterator(p->prev = p->prev->next = new Node(x,p->prev,p));}LIST类的删除节点的过程://删除双向链表中的一个节点iterator erase(iterator itr){ Node *p = itr.current; iterator retVal(p->nex 阅读全文
posted @ 2012-09-18 20:19 xingoo 阅读(586) 评论(0) 推荐(0) 编辑
摘要: LIST类结构 1 template <typename Object> 2 class List 3 { 4 private: 5 struct Node//所有都是公有的 6 { 7 Object data; 8 Node *prev; 9 Node *next; 10 11 Node(const Object & d = Object(),Node *p = NUll,Node *n = Null): 12 d... 阅读全文
posted @ 2012-09-18 20:01 xingoo 阅读(418) 评论(0) 推荐(0) 编辑
摘要: #include <iostream>#include <list>#include <string>#include <vector>#include <bitset>using namespace std;template <typename Container,typename Object>void change(Container & c,const Object & newValue)//改变新值{ typename Container::ierator itr = c.begin(); whi 阅读全文
posted @ 2012-09-18 18:57 xingoo 阅读(664) 评论(0) 推荐(0) 编辑
上一页 1 ··· 99 100 101 102 103