涅槃phy的专栏

Description （Special Judge）We are given a sequence of Npositive integers a = [a1, a2, ..., aN] on which we can perform contractionoperations.One contraction operation consists of replacing adjac

LIKE vs CANDLETime Limit: 2 Seconds      Memory Limit: 65536 KBA microblog caused a war recently -There's the war between LIKE and CANDLE.As you see, there are N accounts are tryin

ProblemDescriptionThe leaders of ACcountry made a decision to regain the TW Island. But they have to face thepowerful force from USB. So the leaders have to hire some excellent soldiersfrom the trai

ProblemDescriptionBob enjoys playingcomputer games, especially strategic games, but sometimes he cannot find thesolution fast enough and then he is very sad. Now he has the following problem.He must

DescriptionThe cows havereconstructed Farmer John's farm, with its N barns (1 <= N <= 150, number1..N) after the terrible earthquake last May. The cows didn't have time torebuild any extra roads, so

Problem DescriptionAlice and Bob are playing "GemsFight!":There are Gems of G different colors , packedin B bags. Each bag has several Gems. G different colors are numbered fromcolor 1 to color G.

Problem DescriptionYou're given an unlimited number of pebbles to distributeacross an N x N game board (N drawn from [3, 15]), where each square on theboard contains some positive point value betwee

Problem DescriptionThere are n pointson the plane, Pi(xi, yi)(1  Before you reach the rightmost point Pn, you can only visit the points thosehave the bigger x-coordinate value. For example, you ar

Problem DescriptionOne day, a hunter named James went to amysterious area to find the treasures. James wanted to research the area andbrought all treasures that he could.The area can be represente

Description In the New Year2014, Xiao Ming is thinking about the question: give two integers Nand K, Calculate thenumber of the numbers of satisfy the following conditions:1. It is a positiv

Problem DescriptionYou may all know the famousstory “Three monks”. Recently they find some places around their temples canbeen used to dig some wells. It will help them save a lot of time. But to di

Problem Description有很多从磁盘读取数据的需求，包括顺序读取、随机读取。为了提高效率，需要人为安排磁盘读取。然而，在现实中，这种做法很复杂。我们考虑一个相对简单的场景。磁盘有许多轨道，每个轨道有许多扇区，用于存储数据。当我们想在特定扇区来读取数据时，磁头需要跳转到特定的轨道、具体扇区进行读取操作。为了简单，我们假设磁头可以在某个轨道顺时针或逆时针匀速旋转，旋转一周的时间是

ProblemDescriptionDear Contestant,I'm going to have a party at my villa at Hali-Bula to celebrate my retirementfrom BCM. I wish I could invite all my co-workers, but imagine how an employeecan e

Problem DescriptionGiven atwo-dimensional array of positive and negative integers, a sub-rectangle is anycontiguous sub-array of size 1 x 1 or greater located within the whole array.The sum of a rec

Problem DescriptionA project managerwants to determine the number of the workers needed in every month. He doesknow the minimal number of the workers needed in each month. When he hires orfires a wo

Description （Special Judge）There is a famous joke-riddlefor children: Three turtles are crawlingalong a road. One turtle says: "There are two turtles ahead of me."The other turtle says: "There

DescriptionThere is a straight highwaywith villages alongside the highway. The highway is represented as an integeraxis, and the position of each village is identified with a single integercoordinat

Problem DescriptionBefore ACM can do anything, abudget must be prepared and the necessary financial support obtained. The mainincome for this action comes from Irreversibly Bound Money (IBM). The id

DescriptionA Bank plans to install amachine for cash withdrawal. The machine is able to deliver appropriate @ billsfor a requested cash amount. The machine uses exactly N distinct billdenominations,

Problem DescriptionACboy has N courses this term,and he plans to spend at most M days on study.Of course,the profit he will gainfrom different course depending on the days he spend on it.How to arra

Problem DescriptionThere is going to be a partyto celebrate the 80-th Anniversary of the Ural State University. The Universityhas a hierarchical structure of employees. It means that the supervisorr

Problem DescriptionACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗？  Input每个测试实例首先包括2个整数，N,M.(1

Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序，在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。 Input测试输入包含若干测试用例。每个测试用例的第1行包含两个正数 Q 和 N，

Problem DescriptionA histogram is apolygon composed of a sequence of rectangles aligned at a common base line. Therectangles have equal widths but may have different heights. For example, thefigure

Problem DescriptionA subsequence of agiven sequence is the given sequence with some elements (possible none) leftout. Given a sequence X = another sequence Z = is a subsequence of X if there exi

很久没写过题了。DP又是最拙计之处。只好从最简单的DP重新写一遍了 Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knowsthat the bad guys usually gets caught in the end, often because they

Problem DescriptionA group of researchers aredesigning an experiment to test the IQ of a monkey. They will hang a banana atthe roof of a building, and at the mean time, provide the monkey with someb

Problem Description度度熊是一只喜欢探险的熊，一次偶然落进了一个m*n矩阵的迷宫，该迷宫只能从矩阵左上角第一个方格开始走，只有走到右上角的第一个格子才算走出迷宫，每一次只能走一格，且只能向上向下向右走以前没有走过的格子，每一个格子中都有一些金币（或正或负，有可能遇到强盗拦路抢劫，度度熊身上金币可以为负，需要给强盗写欠条），度度熊刚开始时身上金币数为0，问度度熊走出迷宫时候身上