Alex

A Bug's LifeTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 29209 Accepted: 9528DescriptionBackgroundProfessor Hopper is researching the sexual behavio

The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: “A lion is never afraid of a hundred sheep”.Nevertheless Shapur has to find w

DescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.The tre

Problem Description Let A1, A2, … , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a given number to a few numbers in a given interval. The other is t

Problem Description GTY has n gay friends. To manage them conveniently, every morning he ordered all his gay friends to stand in a line. Every gay friend has a characteristic value ai , to express how

SudokuTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8575 Accepted: 3074DescriptionIn the game of Sudoku, you are given a large 9 × 9 grid divided into

Parity gameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6595 Accepted: 2562DescriptionNow and then you play the following game with your friend. Your f

Problem Description A girl named Gorwin and a boy named Vivin is a couple. They arrived at a country named LOVE. The country consisting of N cities and only N−1 edges (just like a tree), every edge ha

Black And White Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3971 Accepted Submission(s): 1183Problem Description There are a bunch of

There are n walruses standing in a queue in an airport. They are numbered starting from the queue’s tail: the 1-st walrus stands at the end of the queue and the n-th walrus stands at the beginning of t

Watto, the owner of a spare parts store, has recently got an order for the mechanism that can process strings in a certain way. Initially the memory of the mechanism is filled with n strings. Then the

How Many Answers Are WrongTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2829    Accepted Submission(s): 1084Problem DescriptionTT

PictureTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 10727 Accepted: 5662DescriptionA number of rectangular posters, photographs and other pictures of t

覆盖的面积Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3870    Accepted Submission(s): 1906Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两

AtlantisTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7541    Accepted Submission(s): 3318Problem DescriptionThere are several anc

E. Pillarstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMarmot found a row with n pillars. The i-th pillar has th

Count the ColorsTime Limit: 2 Seconds      Memory Limit: 65536 KB Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your

Problem Description有N个袋子放成一排，每个袋子里有一定数量的糖果，lzs会随机选择连续的几个袋子，然后拿走这些袋子中包含最多糖果的袋子。现问你，在选择x个袋子的情况下，lzs最坏情况下，也就是最少会拿到多少个糖果？对于x取值为1到n都分别输出答案。 Input第一行一个整数T，表示有T组数据。每组数据先输入一行一个整数N(1<=N<=100000)，表示袋子数，接下来一行输入N

Problem Description Zeus 和 Prometheus 做了一个游戏，Prometheus 给 Zeus 一个集合，集合中包含了N个正整数，随后 Prometheus 将向 Zeus 发起M次询问，每次询问中包含一个正整数 S ，之后 Zeus 需要在集合当中找出一个正整数 K ，使得 K 与 S 的异或结果最大。Prometheus 为了让 Zeus 看到人类的伟大，随即同意

Problem Description How many nondecreasing subsequences can you find in the sequence S = {s1, s2, s3, …., sn} ? For example, we assume that S = {1, 2, 3}, and you can find seven nondecreasing subseque

Problem Description 你工作以后, KPI 就是你的全部了. 我开发了一个服务，取得了很大的知名度。数十亿的请求被推到一个大管道后同时服务从管头拉取请求。让我们来定义每个请求都有一个重要值。我的KPI是由当前管道内请求的重要值的中间值来计算。现在给你服务记录，有时我想知道当前管道内请求的重要值得中间值。Input 有大约100组数据。每组数据第一行有一个n(1≤n≤10000)

Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to n from left to right. i-t

George is a cat, so he loves playing very much.Vitaly put n cards in a row in front of George. Each card has one integer written on it. All cards had distinct numbers written on them. Let’s number the

问题描述 You know 8Mao has his own Slime Team. But he soon found that let the Slimes stand in a line and make them from low to high is a such stupid thing since the Slimes are so f[bi][bi]king stupid! As

Language: Frequent values Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 14377 Accepted: 5244DescriptionYou are given a sequence of n integers a1 , a2 , … , an in non-decreas

Description For this problem, you will write a program that reads in a sequence of 32-bit signed integers. After each odd-indexed value is read, output the median (middle value) of the elements receiv

约会安排Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 402    Accepted Submission(s): 127Problem Description　　寒假来了，又到了小明和女神们约会的季节。　　小

A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the strings = abaabaabaabais a (4,3)-repeat with t = aba as its seed

Boring Counting Time Limit: 3000ms Memory limit: 65536K 有疑问？点这里^_^ 题目描述 In this problem you are given a number sequence P consisting of N integer and Pi is the ith element in the sequence. No

Description在给定的n个数字的数字串中，删除其中k(k< n)个数字后，剩下的数字按原次序组成一个新的正整数。请确定删除方案，使得剩下的数字组成的新正整数最大。Input输入一个由n个数字组成的正整数(1< n<=100000)，再输入一个整数k(0<=k < n)，输入的数字保证没有前导0。Output输出删除k位后的最大整数Sample Input102 1Sample Output

Iahub likes trees very much. Recently he discovered an interesting tree named propagating tree. The tree consists of n nodes numbered from 1 to n, each node i having an initial value ai. The root of th

The “BerCorp” company has got n employees. These employees can use m approved official languages for the formal correspondence. The languages are numbered with integers from 1 to m. For each employee w

Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, …, xk (k > 1) is such maximum element xj, that the following in

The clique problem is one of the most well-known NP-complete problems. Under some simplification it can be formulated as follows. Consider an undirected graph G. It is required to find a subset of vert

DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all compu

Cleaning ShiftsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2813 Accepted: 976DescriptionFarmer John's cows, pampered since birth, have reached new hei

Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 44910 Accepted: 13059DescriptionThe citizens of Bytetown, AB, could not stand that the cand

BillboardTime Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11900    Accepted Submission(s): 5240Problem DescriptionAt the entrance to

Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9143 Accepted: 3797DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1...

Get Many Persimmon TreesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3656 Accepted: 2378DescriptionSeiji Hayashi had been a professor of the Nisshinkan