Mike and Feet(CF 547B)
2015-06-11 21:58
197 查看
Mike and Feet
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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-th bear is exactly ai feet
high.
A group of bears is a non-empty contiguous segment of the line. The size of a group is the number of bears in that group. The strengthof
a group is the minimum height of the bear in that group.
Mike is a curious to know for each x such that 1 ≤ x ≤ n the
maximum strength among all groups of size x.
Input
The first line of input contains integer n (1 ≤ n ≤ 2 × 105),
the number of bears.
The second line contains n integers separated by space, a1, a2, ..., an (1 ≤ ai ≤ 109),
heights of bears.
Output
Print n integers in one line. For each x from 1 to n,
print the maximum strength among all groups of size x.
Sample test(s)
input
output
题意:给n个数,问连续区间长度为1,2,3,4,....n 所对应的区间长度最小值中的最大值是多少。
解题:单调栈。
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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-th bear is exactly ai feet
high.
A group of bears is a non-empty contiguous segment of the line. The size of a group is the number of bears in that group. The strengthof
a group is the minimum height of the bear in that group.
Mike is a curious to know for each x such that 1 ≤ x ≤ n the
maximum strength among all groups of size x.
Input
The first line of input contains integer n (1 ≤ n ≤ 2 × 105),
the number of bears.
The second line contains n integers separated by space, a1, a2, ..., an (1 ≤ ai ≤ 109),
heights of bears.
Output
Print n integers in one line. For each x from 1 to n,
print the maximum strength among all groups of size x.
Sample test(s)
input
10 1 2 3 4 5 4 3 2 1 6
output
6 4 4 3 3 2 2 1 1 1
题意:给n个数,问连续区间长度为1,2,3,4,....n 所对应的区间长度最小值中的最大值是多少。
解题:单调栈。
#include<stdio.h> const int N = 200005; struct NODE { int h,w; }S ; int h ,ans ; int main() { int n; scanf("%d",&n); for(int i=0; i<n; i++) scanf("%d",&h[i]),ans[i]=0; h[n++]=0;ans =0; int sum,top=0; for(int i=0; i<n; i++){ sum=0; while(top>0 && S[top].h>=h[i]){ sum+=S[top].w; if(ans[sum]<S[top].h) ans[sum]=S[top].h; --top; } S[++top].h=h[i]; S[top].w=sum+1; } n--; /* 长度为i 的连续数中ans[i]是这i个数的最小数,但却是所有长度为i 的连续数中 最小中的最大数。长度i可以根据长度i+1更新大小,原因是ans[i+1]比在此区间内 的数都要小于等于,所以去掉边上的一个数答案不影响。对于如果要求区间内的 最大值 ,只需对下面的循环倒过来且比较符取反即可。同理。 */ for(int i=n-1; i>=1; i--) if(ans[i]<ans[i+1]) ans[i]=ans[i+1]; for(int i=1; i<n; i++) printf("%d ",ans[i]); printf("%d\n",ans ); }
相关文章推荐
- 虽然你不认识我,但我一直在关注你,余老板 (另附:Li Fei-fei的 English Paper)
- uva 11552 Fewest Flops 线性dp
- CanJS基础教程
- html5客户端跨域访问php服务端数据
- 剑指offer之重建二叉树
- 会错意表错情,搭错车上错床——“度日如年”的故事及“feof()”的故事
- js 瀑布流加载图片
- js--window关闭事件
- js--window关闭事件
- 一篇文章教你学会基础的HTML
- HDFS-datanode数据块部分笔记
- 'strcpy': This function or variable may be unsafe
- Thrift 和 Protocol Buffer
- Java Reference
- Jquery ajax方法解析返回的json数据
- 【html5】Canvas 刮刮卡
- HTML中tr标签设置边框不显示的解决办法
- CSS在线学习
- remove-nth-node-from-end-of-list
- JavaScript继承详解