07 2020 档案

[CF1353E]K-periodic Garland
摘要：【原题】 You are given a garland consisting of nn lamps. States of the lamps are represented by the string ss of length nn. The ii-th character of the str 阅读全文
posted @ 2020-07-30 10:03 kurum! 阅读(129) 评论(0) 推荐(0)
[P3523]DYN-Dynamite（二分+树形dp）
摘要：【原题】 题目描述 The Byteotian Cave is composed of nnn chambers and n−1n-1n−1 corridors that connect them. For every pair of chambers there is unique way to 阅读全文
posted @ 2020-07-29 16:00 kurum! 阅读(189) 评论(0) 推荐(0)
[POJ2226]Muddy Fields（二分图匹配）
摘要：【原题】 Description Rain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 <= R <= 50, 1 <= C <= 50). While good for the grass, 阅读全文
posted @ 2020-07-24 19:20 kurum! 阅读(146) 评论(0) 推荐(0)
[POJ2528]Mayor's posters（线段树+离散化）
摘要：【原题】 Description The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral 阅读全文
posted @ 2020-07-24 14:42 kurum! 阅读(116) 评论(0) 推荐(0)
[CF1321D]Navigation System
摘要：【原题】 The map of Bertown can be represented as a set of nn intersections, numbered from 11 to nn and connected by mm one-way roads. It is possible to m 阅读全文
posted @ 2020-07-24 09:32 kurum! 阅读(127) 评论(0) 推荐(0)
[POJ3280]Cheapest Palindrome（区间dp）
摘要：【原题】 Description Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow 阅读全文
posted @ 2020-07-23 19:32 kurum! 阅读(145) 评论(0) 推荐(0)
[CF1333C]Eugene and an array
摘要：【原题】 Eugene likes working with arrays. And today he needs your help in solving one challenging task. An array cc is a subarray of an array bb if cc ca 阅读全文
posted @ 2020-07-21 21:51 kurum! 阅读(154) 评论(0) 推荐(0)
[POJ3464]Sightseeing（次短路）
摘要：【原题】 Description Tour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one city S to another 阅读全文
posted @ 2020-07-21 19:48 kurum! 阅读(184) 评论(0) 推荐(0)
[POJ1354D]Multiset（权值线段树）
摘要：【原题】 Note that the memory limit is unusual. You are given a multiset consisting of nn integers. You have to process queries of two types: add integer  阅读全文
posted @ 2020-07-21 15:22 kurum! 阅读(177) 评论(0) 推荐(0)
[POJ2186]Popular Cows(Tarjan)
摘要：【原题】 Description Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= 阅读全文
posted @ 2020-07-16 15:51 kurum! 阅读(196) 评论(0) 推荐(0)
[CF1313C] Skyscrapers
摘要：【原题】 This is a harder version of the problem. In this version n≤500000n≤500000 The outskirts of the capital are being actively built up in Berland. Th 阅读全文
posted @ 2020-07-16 09:49 kurum! 阅读(167) 评论(0) 推荐(0)
[CF334D]Water Tree
摘要：【原题】 Mad scientist Mike has constructed a rooted tree, which consists of n vertices. Each vertex is a reservoir which can be either empty or filled wi 阅读全文
posted @ 2020-07-15 14:47 kurum! 阅读(210) 评论(0) 推荐(0)