
ZOJ
文章平均质量分 83
深海沧澜夜未央
这个作者很懒,什么都没留下…
展开
-
ZOJ 3203 Light Bulb 三分
Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house,原创 2017-09-02 14:33:42 · 293 阅读 · 0 评论 -
ZOI 1610 Count the Colors 线段树区间更新 (求相同值的段)
Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segments of different colors you can see at last.InputTh...原创 2018-02-08 11:01:01 · 264 阅读 · 0 评论 -
第18届浙江大学校赛 F Schrödinger's Knapsack (DP)
DreamGrid has a magical knapsack with a size capacity of called the Schrödinger's knapsack (or S-knapsack for short) and two types of magical items called the Schrödinger's items (or S-items for shor...原创 2018-04-10 10:04:15 · 438 阅读 · 0 评论 -
第18届浙江大学校赛 C Mergeable Stack (STL list与多栈模拟合并)
Given initially empty stacks, there are three types of operations:1 s v: Push the value onto the top of the -th stack.2 s: Pop the topmost value out of the -th stack, and print that value. If the -t...原创 2018-04-10 08:35:08 · 724 阅读 · 0 评论 -
第十五届浙江省赛 B King of Karaoke(对于负数要成为数组下标的处理)
题目链接:http://acm.zju.edu.cn/onlinejudge/showContestProblem.do?problemId=5753题意:给定两个序列Dn和Sn,可以把序列Dn中的每个值加上一个任意数K,问Dn序列加上K后最多有多少个数和Sn序列对应的数相等。思路:直接2个序列相减即可,只是会出现负数的情况,所以用1)map来构造map<int ,int > 此时是可...原创 2018-04-30 14:55:27 · 288 阅读 · 0 评论