堆/队列
文章平均质量分 73
big up
这个作者很懒,什么都没留下…
展开
-
uva442
题目: 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 multiplications are performed is arbitrar原创 2015-10-25 15:31:22 · 520 阅读 · 0 评论 -
uva10382
题目大意: 最少要用多少个给定的圆才能把长度为l,宽度为w的完全覆盖住。思路: 刚开始想到的是区间覆盖问题 可以WA了,后来又改了以下结果超时了 T.T 求帮忙代码: TLE:#include <iostream>using namespace std;#include <cstring>#include <stdio.h>#include <cmath>int N;double原创 2015-12-28 20:02:20 · 483 阅读 · 0 评论 -
uva10152
uva10152原创 2015-10-25 15:24:05 · 366 阅读 · 0 评论 -
uva127
题目: You are to simulate the playing of games of Accordian'' patience, the rules for which are as follows: Deal cards one by one in a row from left to right, not overlapping. Whenever the card matches原创 2015-10-25 16:13:14 · 1190 阅读 · 1 评论 -
uva101
Background Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world in原创 2015-10-12 20:54:41 · 1110 阅读 · 0 评论 -
uva133
In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole applicants will be placed in a large原创 2015-10-12 21:04:05 · 1649 阅读 · 1 评论 -
uva11234
题目: Arithmetic expressions are usually written with the operators in between the two operands (which is called infix notation). For example, (x + y) ∗ (z − w) is an arithmetic expression in infix not原创 2015-10-25 15:55:49 · 335 阅读 · 0 评论 -
uva11111
题目: 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 halves, so that one finds another原创 2015-10-25 15:45:19 · 417 阅读 · 0 评论 -
uva673
题目: You are given a string consisting of parentheses () and []. A string of this type is said to be correct: (a) if it is the empty string (b) if A and B are correct, AB is correct, (c) if A is原创 2015-10-25 15:27:04 · 450 阅读 · 0 评论 -
uva10050
题目: A social research organization has determined a simple set of parameters to simulate the behavior of the political parties of our country. One of the parameters is a positive integer h (called th原创 2015-10-25 16:10:45 · 309 阅读 · 0 评论 -
uva540
题目:Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the原创 2015-10-25 16:04:04 · 1717 阅读 · 0 评论 -
关于求最长递增子序列会超时的问题(使用栈)
类似于uva10524的题目。 uva10534的题目大意是给出一串数字,最多有10000个,问这串数字里面可以组成的前n个数字递增和后n个数字递减的最长序列是多少。如果直接用求最长递增子序列的方法的话,有两层for肯定是会超时的。那么可以使用堆栈的方式,用栈保存数字。 如果遇到第一个数字或者遇到比当前的栈顶数字更大的数字的话那么就将其存入栈顶中。 如果遇到的数字不比栈顶大的话,那么就找栈中刚原创 2016-05-15 14:43:59 · 516 阅读 · 0 评论