草稿箱建设中

摘要： 【原题】 Description The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral 阅读全文

摘要： 【原题】 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 阅读全文

摘要： 【原题】 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 阅读全文

摘要： 【原题】 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 阅读全文

摘要： 【原题】 Description Tour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one city S to another 阅读全文

摘要： 【原题】 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  阅读全文

摘要： 【原题】 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 <= 阅读全文

摘要： 【原题】 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 阅读全文

摘要： 【原题】 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 阅读全文

摘要： hdu-3183A Magic Lamp 题意：对给定m位数删除其中n位，不改变剩余数字排列，求剩余数字组成的最小数。 思路：选m - n个数 RMQ求最小值 t数组求最小值第一次出现的位置 左右区间随之改变 wa了两次 没特判 m = n 的情况 / t数组存了最小值最后一次出现的位置(25行没用 阅读全文