![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
STL
Joyyiwei
这个作者很懒,什么都没留下…
展开
-
uva 11111
题意 : 就是括号匹配的加深,可以把 -a -> (a , +b - > b) ,另外一点是,括号里数的和不能大于括号外,注意是直接嵌套的,比如:(9(4 (2)5(1) ) 9),我们值考虑4+5是不是大于等于9,而不必在意2和5,接下来的就是括号匹配问题了,数与数必须是相等的 #include #include #include using namespace std; i原创 2013-08-02 16:13:55 · 842 阅读 · 0 评论 -
UVA - 11136 Hoax or what
题意:超市每次从票箱选出最大和最小的账单,将(Max-Min)给Max的人,问n天后超市付出多少钱 思路:要省去排序的容器就有set和multiset,为了储存重复的数字,所以采用multiset #include #include #include #include #include using namespace std; int n,t,m; int Min,Max; lon原创 2014-02-21 20:17:54 · 1399 阅读 · 1 评论 -
POJ - 1002 487-3279
题意:求将字符串转化为数字后重复出现的次数 思路:map #include #include #include #include #include using namespace std; map s; char str[128]; int num[] = { 2,2,2, 3,3,3, 4,4,4, 5,5,5, 6,6,6, 7原创 2014-03-05 15:31:11 · 881 阅读 · 0 评论 -
POJ - 1363 Rails
Description There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It wa原创 2014-07-17 09:54:51 · 884 阅读 · 0 评论 -
UVA - 12096 The SetStack Computer
维护 N(1≤N≤2000) 个操作, 可能的五种操作如下: PUSH: 在栈顶加入一个空集合 A={} ; DUP: 把栈顶集合 A 复制一遍再加进去; UNION: 弹出栈顶集合 A 及其下集合 B , 把它们的并集加入栈; INTERSECT: 弹出栈顶集合 A 及其下集合 B , 把他们的交集加入栈; ADD: 弹出栈顶集合 A 及其下集合 B原创 2014-02-22 22:15:24 · 1279 阅读 · 0 评论 -
POJ - 2442 Sequence
Description Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind o原创 2014-08-08 14:22:45 · 927 阅读 · 0 评论 -
HDU - 5038 Grade
Problem Description Ted is a employee of Always Cook Mushroom (ACM). His boss Matt gives him a pack of mushrooms and ask him to grade each mushroom according to its weight. Suppose the weight of a mu原创 2014-09-21 23:11:56 · 1355 阅读 · 0 评论 -
UVA - 246 10-20-30 (模拟+STL)
Description 10-20-30 A simple solitaire card game called 10-20-30 uses a standard deck of 52 playing cards in which suit is irrelevant. The value of a face card (king, queen,原创 2014-09-09 20:04:54 · 1600 阅读 · 0 评论