樱花满地集于我心，楪舞纷飞祈愿相随

Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 43131 Accepted: 13068DescriptionChosen Problem Solving and Program design as an optional co

You are given an array of N integers. You should support the following queries on this array.0 L R : Find the minimum integer in the range AL, AL+1, ..., AR.1 L R X : You should apply the assignme

A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of end

Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 19422 Accepted: 9616DescriptionRailway tickets were difficult to buy around the Lunar New Y

大家都知道“堆栈”是一种“先进后出”的线性结构，基本操作有“入栈”（将新元素插入栈顶）和“出栈”（将栈顶元素的值返回并从堆栈中将其删除）。现请你实现一种特殊的堆栈，它多了一种操作叫“查中值”，即返回堆栈中所有元素的中值。对于N个元素，若N是偶数，则中值定义为第N/2个最小元；若N是奇数，则中值定义为第(N+1)/2个最小元。输入格式：输入第一行给出正整数N（5）。随后N行，每行给出

Potted FlowerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4793 Accepted: 1830DescriptionThe little cat takes over the management of a new park. The

Stars in Your WindowTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12087 Accepted: 3303DescriptionFleeting time does not blur my memory of you. Can i

Who Gets the Most Candies?Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 14121 Accepted: 4461Case Time Limit: 2000MSDescriptionN children are

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

A - A Simple Problem with IntegersTime Limit:5000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou have N integers, A1, A2, ... , AN. You ne

C - Balanced LineupTime Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000)

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 with water.The vertices of the tree are numbered from 1 to