AndyQsmart - 博客园

ACM学习历程——UVA10112 Myacm Triangles（计算几何，多边形与点的包含关系）

摘要： DescriptionProblem B: Myacm TrianglesProblem B: Myacm TrianglesSource file:triangle.{c, cpp, java, pas}Input file:triangle.inOutput file:triangle.outT... 阅读全文

posted @ 2014-12-26 12:33 AndyQsmart 阅读(317) 评论(0) 推荐(0)

ACM学习历程——UVA540 Team Queue（队列，map：Hash）

摘要： DescriptionTeam Queue Team QueueQueues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, i... 阅读全文

posted @ 2014-12-14 12:14 AndyQsmart 阅读(252) 评论(0) 推荐(0)

ACM学习历程——UVA11234 Expressions（栈，队列，树的遍历，后序遍历，bfs）

摘要： DescriptionProblem E: Expressions2007/2008 ACM International Collegiate Programming Contest University of Ulm Local ContestProblem E: ExpressionsArith... 阅读全文

posted @ 2014-12-14 12:06 AndyQsmart 阅读(248) 评论(0) 推荐(0)

ACM学习历程——UVA11111 Generalized Matrioshkas（栈）

摘要： DescriptionProblem B - Generalized Matrioshkas Problem B - Generalized MatrioshkasVladimir worked for years making matrioshkas, those nesting dolls th... 阅读全文

posted @ 2014-12-14 11:59 AndyQsmart 阅读(256) 评论(0) 推荐(0)

ACM学习历程——UVA442 Matrix Chain Multiplication（栈）

摘要： DescriptionMatrix Chain MultiplicationMatrix Chain MultiplicationSuppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are mat... 阅读全文

posted @ 2014-12-14 11:49 AndyQsmart 阅读(264) 评论(0) 推荐(0)

ACM学习历程——HDU5137 How Many Maos Does the Guanxi Worth（14广州10题）（单源最短路）

摘要： Problem Description "Guanxi" is a very important word in Chinese. It kind of means "relationship" or "contact". Guanxi can be based on friendship, but... 阅读全文

posted @ 2014-12-14 11:39 AndyQsmart 阅读(200) 评论(0) 推荐(0)

ACM学习历程——UVA127 "Accordian" Patience（栈，链表）

摘要： Description``Accordian'' PatienceYou are to simulate the playing of games of ``Accordian'' patience, the rules for which are as follows:Deal cards one... 阅读全文

posted @ 2014-12-10 14:48 AndyQsmart 阅读(415) 评论(0) 推荐(0)

ACM学习历程——POJ 1700 Crossing River（贪心）

摘要： DescriptionA group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arr... 阅读全文

posted @ 2014-11-23 12:14 AndyQsmart 阅读(340) 评论(0) 推荐(0)

ACM学习历程——POJ 2376 Cleaning Shifts（贪心）

摘要： Description Farmer John is assigning some of his N (1 #include #include #include #include #include #include #include #include #include #include #defin... 阅读全文

posted @ 2014-11-23 12:05 AndyQsmart 阅读(272) 评论(0) 推荐(0)

ACM学习历程——HDU1331 Function Run Fun（锻炼多维dp的打表）

摘要： Description We all love recursion! Don't we? Consider a three-parameter recursive function w(a, b, c): if a 20 or b > 20 or c > 20, then w(a, b, c) r... 阅读全文

posted @ 2014-11-20 20:32 AndyQsmart 阅读(286) 评论(0) 推荐(0)