随笔分类 -  数据结构 -- (单调)栈

摘要:Description Farmer John has purchased a subscription to Good Hooveskeeping magazine for his cows, so they have plenty of material to read while waitin 阅读全文
posted @ 2019-03-06 17:08 Wolfycz 阅读(239) 评论(0) 推荐(0) 编辑
摘要:题目传送门:https://agc003.contest.atcoder.jp/tasks/agc003_e 题目大意 一串数,初始为1N,现有Q个操作,每次操作会把数组长度变成Li,多余的长度直接截断;长度不够则循环填充,问最后1N每个数的出现次数 首先维护一 阅读全文
posted @ 2018-12-18 16:36 Wolfycz 阅读(147) 评论(0) 推荐(0) 编辑
摘要:Description N个矩形,排成一排. 现在希望用尽量少的矩形海报Cover住它们. Input 第一行给出数字N,代表有N个矩形.N在[1,250000] 下面N行,每行给出矩形的长与宽.其值在[1,1000000000]2 1/2 Postering Output 最少数量的海报数. Sa 阅读全文
posted @ 2018-04-26 21:23 Wolfycz 阅读(256) 评论(0) 推荐(0) 编辑
摘要:Description Having become bored with standard 2 dimensional artwork (and also frustrated at others copying her work), the great bovine artist Picowso 阅读全文
posted @ 2018-02-04 17:07 Wolfycz 阅读(245) 评论(0) 推荐(0) 编辑
摘要:Description Farmer John's N (1 include include include include define inf 0x7f7f7f7f using namespace std; typedef long long ll; typedef unsigned int u 阅读全文
posted @ 2018-02-04 17:05 Wolfycz 阅读(267) 评论(0) 推荐(0) 编辑
摘要:Description 农民John的某 N 头奶牛 (1 include include include include define inf 0x7f7f7f7f using namespace std; typedef long long ll; typedef unsigned int ui 阅读全文
posted @ 2018-02-04 17:04 Wolfycz 阅读(209) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示