kongming_acm的专栏

In 0th day, there are n-1 people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, that is, a people meets a people or a bloodsucker mee

奶牛Bessie有N分钟时间跑步，每分钟她可以跑步或者休息。若她在第i分钟跑步，可以跑出D_i米，同时疲倦程度增加1（初始为0）。若她在第i分钟休息，则疲倦程度减少1。无论何时，疲倦程度都不能超过M。另外，一旦她开始休息，只有当疲惫程度减为0时才能重新开始跑步。在第N分钟后，她的

Problem DescriptionIn the dark path, the single figure is walking difficultly in the listless rainfall. No one knows his real destination.

Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队（山地上不能够部署炮兵部队）；一支炮兵部队

DescriptionFarmer John has purchased a lush new rectangular pasture composed of M byN (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He want

Problem DescriptionWhen wake up, lxhgww find himself in a huge maze.The maze consisted by N rooms and tunnels connecting these rooms

Problem DescriptionThere are no days and nights on byte island, so the residents here can hardly determine the length of a single day. For

Problem DescriptionAcmers have been the Earth Protector against the evil enemy for a long time, now it’s your turn to protect our home.

Problem DescriptionA school bought the first computer some time ago(so this computer's id is 1). During the recent years the school boug

Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting

#include#include#include#includeusing namespace std;#define maxs( a , b ) a>b?a:b#define mins( a , b ) a>b?b:aconst int MAX_N = 110005;int d

he planform of the LOOPS is a rectangle of R*C grids. There is a portal in each grid except the exit grid. It costs Homura 2 magic power to

DescriptionHave you ever heard a star charity show called Charitable Exchange? In this show, a famous star starts with a small item which va

Problem DescriptionYou are given a necklace consists of N beads linked as a circle. Each bead is either crystal or jade.Now, your task is:1.

Problem DescriptionThere's a monster-attacking game on the Renren's open platform, and the game's background are showing below.Where lies a

给定一个信封，最多只允许粘贴N（N≤100）张邮票，我们现在有M（M≤100）种邮票，面值分别为：X1，X2……Xm（Xi≤255为正整数），并假设各种邮票都有足够多张。要求计算所能获得的邮资最大范围。即求最大值MAX，使1-MAX之间的每一个邮资都能得到。例如：N=4，有2种邮票，面值分别为1分，4分，于是可以得到1-10分和12分，13分，16分邮资，由于得不到11分和15分，所以邮资的最大范围max=10       输入格式 Input Format   第一行为最多粘贴的邮票张数n。第二行为邮票种

 FromAdmin☆硬币问题        描述 Description     有n种硬币，面值为别为a[1],a[2],a[3]……a[n]，每种都有无限多。给定非负整数s，可以选取多少个硬币使得面值和恰好为s？输出硬币数目最小值和最大值       输入格式 Input Format   第1行n第2行s第3到n+2行为n种不同的面值        输出格式 Output Format   第1行为最小值第2行为最大值       样例输入 Sample Input    36123

 FromAdmin☆没有上司的舞会        描述 Description    Ural大学有N个职员，编号为1~N。他们有从属关系，也就是说他们的关系就像一棵以校长为根的树，父结点就是子结点的直接上司。每个职员有一个快乐指数。现在有个周年庆宴会，要求与会职员的快乐指数最大。但是，没有职员愿和直接上司一起与会。       输入格式 Input Format   第一行一个整数N。(1<=N<=6000)<br />接下来N行，第i+1行表示i号职员的快乐指数Ri。(-128<=Ri<=127)<b

From Admin☆乘积最大       背景 Background  NOIP 2000 普及组 第三道

Problem DescriptionThere are two kinds of tasks, namely A and B. There are N workers and the i-th worker would like to finish one task A

Problem DescriptionFor a set of sequences of integers｛a1，a2，a3，...an｝, we define a sequence｛ai1,ai2,ai3...aik｝in which 1<=i1<i2<i3<...<ik<

There are three different lathes in a factory namely A,B,C. They are all able to work on all kinds of workpieces. And there aren workpieces to be processed, denoted by 1,2,..,n. Due to different i

Problem DescriptionAli has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW.If

Problem DescriptionAll the shops use discount to attract customers, but some shops doesn’t give direct discount on their goods, instead, they give discount only when you bought more than a cer

Problem DescriptionAli was doing a physic experiment which requires him to observe an electric wave. He needs the height of each peak value and valley value for further study (a peak value means t

After 4 years' waiting, the game "Chinese Paladin 5" finally comes out. Tomato is a crazyfan,andluckilyhegotthefirstrelease.Nowheisathome,readytobeginhisjourney. Butbeforestartingthegame,hemustfir

'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the signals on the chip connecting the ports

Brackets SequenceTime Limit:1000msMemory limit:10000kB题目描述Let us define a regular brackets sequence in the following way:1. Empty sequence is a regular sequence.2. If S is a regular se

Problem DescriptionJack and Jill play a game called "Leap Frog" in which they alternate turns jumping over each other. Both Jack and Jill can jump a maximum horizontal distance of 10 units in any si

Xiaoming is a 5-year old boy. He has many toys. Among them there is a magic box. On the top of the box there are n * m grids. One can color

Problem DescriptionAfter being assaulted in the parking lot by Mr. Miyagi following the "All Valley Karate Tournament", John Kreese has

One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him an

Problem DescriptionFJ is going to do some shopping, and before that, he needs some boxes to carry the different kinds of stuff he is going

The signature of a permutation is a string that is computed as follows: for each pair of consecutive elements of the permutation, write down

Problem DescriptionSeveral friends are planning to take tourism during the next holiday. They have selected some places to visit. They h

DescriptionGord is training for a marathon. Behind his house is a park with a large network of jogging trails connecting water stations.

Problem DescriptionCC lives on the tree which has N nodes.On every leaf of the tree there is an apple(leaf means there is only one branc

Problem DescriptionBob has n matches. He wants to compose numbers using the following scheme (that is, digit 0, 1, 2, 3, 4, 5, 6, 7, 8,

 FromVivian Snow☆Elevator        背景 Background   广东汕头聿怀初中 Train#2 Problem4<br />       描述 Description    现有N种箱子，每种箱子高度H_i，数量C_i。现选取若干箱子堆成一列，且第i种箱子不能放在高度超过A_i的地方。试求最大叠放高度。<br />       输入格式 Input Format   第一行，一个整数，表示箱子种类N。<br />接下来N行，每行三个整数，表示H_i，A_i，C_i。<br

尼克每天上班之前都连接上英特网，接收他的上司发来的邮件，这些邮件包含了尼克主管的部门当天要完成的全部任务，每个任务由一个开始时刻与一个持续时间构成。<br />尼克的一个工作日为N分钟，从第一分钟开始到第N分钟结束。当尼克到达单位后他就开始干活。如果在同一时刻有多个任务需要完成，尼克可以任选其中的一个来做，而其余的则由他的同事完成，反之如果只有一个任务，则该任务必需由尼克去写成，假如某些任务开始时刻尼克正在工作，则这些任务也由尼克的同事完成。如果某任务于第P分钟开始，持续时间为T分钟，则该任务将在第P+T-