![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
文章平均质量分 87
MIsike
创造,要有毁灭的觉悟!
展开
-
奶牛排队
奶牛排队 ★★ 输入文件:tahort.in 输出文件:tahort.out 简单对比 时间限制:1 s 内存限制:128 MB 【题目描述】 奶牛在熊大妈的带领下排成了一条直队。 显然,不同的奶牛身高不一定相同…… 现在,奶牛们想知道,如果找出一些连续的奶牛,要求最左边的奶牛A是最矮的,最右边的B是最高的,且B高于A奶牛,中间如果存在奶牛,则身高不能和A、原创 2013-08-13 10:20:21 · 1587 阅读 · 0 评论 -
Billboard
Billboard Problem Description At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all po原创 2013-09-04 17:26:19 · 592 阅读 · 0 评论 -
Minimum Inversion Number
Minimum Inversion Number Problem Description The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj. For a given sequence of nu原创 2013-09-03 12:30:05 · 565 阅读 · 0 评论 -
poj 3264 Frequent values
Frequent values Time Limit: 2000MS Memory Limit: 65536K Description You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition原创 2013-09-10 10:38:10 · 882 阅读 · 0 评论 -
Just a Hook
Just a Hook Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks wh原创 2013-09-07 20:08:36 · 713 阅读 · 0 评论 -
I Hate It
I Hate It Problem Description 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input 本题目包含多组测试,请处理到文件结束。 在原创 2013-09-02 15:22:27 · 480 阅读 · 0 评论 -
A Simple Problem with Integers
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Case Time Limit: 2000MS Description You have N integers, A1, A2, ... , AN. You need t原创 2013-09-07 20:51:24 · 545 阅读 · 0 评论 -
Lost Cows
Lost Cows Time Limit: 1000MS Memory Limit: 65536K Description N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judg原创 2013-09-07 11:15:27 · 678 阅读 · 0 评论 -
Balanced Lineup
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Case Time Limit: 2000MS Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) alwa原创 2013-09-07 09:34:34 · 697 阅读 · 0 评论 -
Mex
Mex Problem Description Mex is a function on a set of integers, which is universally used for impartial game theorem. For a non-negative integer set S, mex(S) is defined as the least non-negativ原创 2013-09-26 21:38:53 · 2673 阅读 · 0 评论