逆风的方向 更适合飞翔

Weighted MedianTime Limit: 2000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述For n elements x1, x2, ..., xn with positive integer weights w1, w2, ..., wn. The weighted median is the

Revenge of Segment TreeProblem DescriptionIn computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments c

The Windy'sTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4158 Accepted: 1777DescriptionThe Windy's is a world famous toy factory that owns M top-cla

Going HomeTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2963    Accepted Submission(s): 1492Problem DescriptionOn a grid map th

Special FishProblem DescriptionThere is a kind of special fish in the East Lake where is closed to campus of Wuhan University. It’s hard to say which gender of those fish are, because ever

奔小康赚大钱Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另外的村领导希望得到最大的效益,

过山车Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11509    Accepted Submission(s): 5066Problem DescriptionRPG girls今天和大家一起去游乐场玩，终

Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4410 Accepted: 2496DescriptionThere is going to be a party to celebrate the 80-th Ann

InstructionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 347    Accepted Submission(s): 101Problem Description Nowadays, Jim G

Osu!Problem DescriptionOsu! is a very popular music game. Basically, it is a game about clicking. Some points will appear on the screen at some time, and you have to click them at a correct

Hatsune MikuProblem DescriptionHatsune Miku is a popular virtual singer. It is very popular in both Japan and China. Basically it is a computer software that allows you to compose a song on yo

Problem Descriptionshadow来到一片神奇的土地，这片土地上不时会出现一些有价值的水晶，shadow想要收集一些水晶带回去，但是这项任务太繁杂了，于是shadow让自己的影子脱离自己并成为一个助手来帮助自己收集这些水晶。shadow把这片土地划分成n*m个小方格，某些格子会存在一些shadow和他的影子都无法穿越的障碍，比如巨石、树木、野兽等。shadow预先探测到

Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 941    Accepted Submission(s): 352Problem Description《Journey to t

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 77763 Accepted: 28905DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或

Problem Description在图论中，树：任意两个顶点间有且只有一条路径的图。生成树：包含了图中所有顶点的一种树。最小生成树：对于连通的带权图(连通网)G，其生成树也是带权的。生成树T各边的权值总和称为该树的权，权最小的生成树称为G的最小生成树(Minimum Spanning Tree)。最小生成树可简记为MST。但是，对于一个图而言，最小生成树并不是唯一的。现

roblem DescriptionJack最近喜欢到学校餐厅吃饭，好吃干净还便宜。在学校餐厅，有a种汤，b种饭，c种面条，d种荤菜，e种素菜。为了保证膳食搭配，Jack每顿饭都会点1~2样荤菜，1~2样素菜（不重复）。同时，在Jack心情好的时候，会点一样饭，再配上一种汤。在心情不好的时候，就只吃一种面条。因为经济有限，Jack每次点餐的总价在min~max之间。Jack想知

Average ScoreTime Limit: 2 Seconds      Memory Limit: 65536 KBBob is a freshman in Marjar University. He is clever and diligent. However, he is not good at math, especially in Mathematical A

Wang Xifeng's Little PlotProblem Description《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly

Mondriaan's DreamTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 783    Accepted Submission(s): 506Problem Description Squares

Fast FoodTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2173    Accepted Submission(s): 930Problem DescriptionThe fastfood chain

Problem 1686 神龙的难题Accept: 444    Submit: 1365Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description这是个剑与魔法的世界.英雄和魔物同在,动荡和安定并存.但总的来说,库尔特王国是个安宁的国家,人民安居乐业,魔物也比较少.但是.总有一些魔物不时会进

RadarTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2593    Accepted Submission(s): 1012Problem Description N cities of the Jav

Treasure MapTime Limit: 2 Seconds      Memory Limit: 32768 KBYour boss once had got many copies of a treasure map. Unfortunately, all the copies are now broken to many rectangular pieces, an

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16202 Accepted: 4349DescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), could you find some ro

Easy FindingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16178 Accepted: 4343DescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), co

DESCRIPTIONThere is an N*M matrix with only 0s and 1s, (1 INPUTThere are multiply test cases. First line: two integers N, M; The following N lines: Every line first comes an integer C(1 <= C <= 100),

题目：时间限制:2000ms单点时限:1000ms内存限制:256MB描述小Ho给自己定了一个宏伟的目标：连续100天每天坚持在hihoCoder上提交一个程序。100天过去了，小Ho查看自己的提交记录发现有N天因为贪玩忘记提交了。于是小Ho软磨硬泡、强忍着小Hi鄙视的眼神从小Hi那里要来M张"补提交卡"。每张"补提交卡"都可以补回一天的提交，将

ContestProblem DescriptionIn the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are given 5 hours to solve between 8 and 12 programming pr

Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8062 Accepted: 4295DescriptionFarmer John has purchased a lush new rectangular pasture compos

Generalized Palindromic NumberTime Limit: 2 Seconds      Memory Limit: 65536 KBA number that will be the same when it is written forwards or backwards is known as a palindromic number. For e

Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11407 Accepted: 4539DescriptionA number of schools are connected to a computer netwo

首先是一些知识整理：来源于网络：以下转载于：http://blog.sina.com.cn/s/blog_4dff87120100r58c.html Kosaraju算法是求解有向图强连通分量（strong connectedcomponent）的三个著名算法之一，能在线性时间求解出一个图的强分量。什么是强连通分量？在这之前先定义一个强连通性（strong connectivi

Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56869 Accepted: 21862DescriptionEvery time it rains on Farmer John's fields, a pond fo

Flow ProblemProblem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.

GradeProblem DescriptionTed is a employee of Always Cook Mushroom (ACM). His boss Matt gives him a pack of mushrooms and ask him to grade each mushroom according to its weight. Suppose the

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 15417 Accepted: 6602DescriptionGiven a n × n matrix A and a positive integer k,

FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9517 Accepted: 6767DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = F

WalkProblem DescriptionI used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation looks like a connected bidirectional graph, and

A very hard Aoshu problemProblem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary school students. T

he HimalayasTime Limit: 2 Seconds      Memory Limit: 65536 KBAs an artist, Bob usually need to travel around the world. He made a lot of sketch of scenery on his journey. A famous spot he ha