
数据结构
文章平均质量分 84
974792789
不要在能吃苦的年纪追求安逸。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
ShellSort uva
关于list容器的使用。原创 2014-05-07 00:14:04 · 1398 阅读 · 0 评论 -
Codeforces Round #285 (Div. 2) C. Misha and Forest
C. Misha and Foresttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a forest as a non-directed原创 2015-01-23 13:18:21 · 494 阅读 · 0 评论 -
VK Cup 2012 Qualification Round 2--E. Zebra Tower 离散化+优先队列
E. Zebra Towertime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Janet likes playing with cubes. Act原创 2015-01-26 21:41:38 · 571 阅读 · 0 评论 -
Nearest Common Ancestors+POJ+一道最近公共祖先的模板题
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18886 Accepted: 9991DescriptionA rooted tree is a well-known data structure in c原创 2014-09-29 16:44:46 · 465 阅读 · 0 评论 -
Machine+zoj+二叉树
MachineTime Limit: 2 Seconds Memory Limit: 65536 KBIn a typical assembly line, machines are connected one by one. The first machine's output product will be the second machine's raw mater原创 2014-09-16 18:53:41 · 446 阅读 · 0 评论 -
1329: 一行盒子+csuoj+数组模拟链表
1329: 一行盒子Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 381 Solved: 72[Submit][Status][Web Board]Description你有一行盒子,从左到右依次编号为1, 2, 3,…, n。你可以执行四种指令:1 X Y表示把盒子X移动到盒子Y左边(如果X已经在Y的左边则忽略原创 2014-09-04 18:30:06 · 548 阅读 · 0 评论 -
K Smallest Sums uva+优先队列
K Smallest SumsYou're given k arrays, each array has k integers. There are kk ways to pick exactly one element in each array and calculate the sum of the integers. Your task is to find the k small原创 2014-07-19 20:20:22 · 511 阅读 · 0 评论 -
Tree Summing uva
Tree Summing原创 2014-05-13 11:06:01 · 465 阅读 · 0 评论 -
Spreadsheet uva+递归
Spreadsheet In 1979, Dan Bricklin and Bob Frankston wrote VisiCalc, the first spreadsheetapplication. It became a huge success and, at that time, was the killerapplication for the Apple II原创 2014-05-19 01:03:29 · 454 阅读 · 0 评论 -
Expressions uva
ExpressionsArithmetic expressions are usually written with the operators inbetween thetwo operands (which is called infix notation). For example,(x+y)*(z-w)is an arithmetic expression in infix n原创 2014-05-10 21:13:39 · 465 阅读 · 0 评论 -
Generalized Matrioshkas uva
Generalized Matrioshkas Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be opened in two hal原创 2014-05-10 18:25:16 · 470 阅读 · 0 评论 -
Matrix Chain Multiplication uva
Matrix Chain Multiplication Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices.Since matrix multiplication is associative, the order in which multip原创 2014-05-07 23:03:54 · 507 阅读 · 0 评论 -
Parentheses Balance uva
Parentheses Balance You are given a string consisting of parentheses () and []. Astring of this type is said to becorrect:(a)if it is the empty string(b)if A and B are correct, AB is c原创 2014-05-07 17:59:15 · 634 阅读 · 0 评论 -
Codeforces Round #287 (Div. 2) C. Guess Your Way Out!+二叉树
C. Guess Your Way Out!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr bought a new video game "Guess Yo原创 2015-01-25 00:17:30 · 556 阅读 · 0 评论