Sticks Problem (单调队列)
来源:互联网 发布:刘强东脸盲 知乎 编辑:程序博客网 时间:2024/05/19 14:51
Sticks Problem
Time Limit : 12000/6000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 31 Accepted Submission(s) : 6
Problem Description
Xuanxuan has n sticks of different length. One day, she puts all her sticks in a line, represented by S1, S2, S3, ...Sn. After measuring the length of each stick Sk (1 <= k <= n), she finds that for some sticks Si and Sj (1<= i < j <= n), each stick placed between Si and Sj is longer than Si but shorter than Sj.
Now given the length of S1, S2, S3, …Sn, you are required to find the maximum value j - i.
Now given the length of S1, S2, S3, …Sn, you are required to find the maximum value j - i.
Input
The input contains multiple test cases. Each case contains two lines.<br>Line 1: a single integer n (n <= 50000), indicating the number of sticks.<br>Line 2: n different positive integers (not larger than 100000), indicating the length of each stick in order.
Output
Output the maximum value j - i in a single line. If there is no such i and j, just output -1.
Sample Input
45 4 3 646 5 4 3
Sample Output
1-1
Source
PKU
题意:找到一个最长的区间,这个区间中间每个数字都要小于最后一个数并且要大于最开始(即区间开头)的数,输出符合要求的最大区间长度。
思路:先记录每一位数后面连续大于这个数的长度,然后再这个长度里找最大的数,这样可求得最大的区间。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <string>#include <map>#include <stack>#include <vector>#include <set>#include <queue>#include <iomanip>#define maxn 50005#define mod 1000000007#define INF 0x3f3f3f3f#define exp 1e-6#define pi acos(-1.0)using namespace std;int a[maxn],dis[maxn]; //a用来存储数据,dis用来表示某一个数后大于连续大于这个数的长度int n;int main(){ ios::sync_with_stdio(false); int i; int ans,flag,maxx; while(cin>>n) { ans=0; for(i=1;i<=n;i++){cin>>a[i];dis[i]=1;} //输入数据吗,初始化为1 dis[n+1]=-1; //别忘了这个,因为后面寻找最大的的时候可能超过。 for(i=n;i>=0;i--) { while(a[i]<a[i+dis[i]])dis[i]+=dis[i+dis[i]]; //找出所有符合要求的长度 } for(i=1;i<=n;i+=flag+1) //下一次要在最大的那个数的下一个位置 { maxx=flag=-1; for(int j=0;j<dis[i];j++) { if(a[i+j]>maxx){maxx=a[i+j],flag=j;} //在区间内找长度。 } if(ans<flag)ans=flag; //找到最大的值 } if(ans)cout<<ans<<endl; else cout<<"-1"<<endl; } return 0;}
阅读全文
1 0
- Sticks Problem (单调队列)
- Sticks Problem--(单调队列)
- FZU problem 1896 单调队列
- A-B Problem(Dec)解题报告 - 单调队列
- hdu 3706 Second My Problem First(单调队列)
- hdu 3706 Second My Problem First(单调队列)
- POJ2452---Sticks Problem(单调栈+RMQ,方法不够优秀)
- hdu2993 MAX Average Problem(斜率+单调队列)
- foj Problem 1894 志愿者选拔---单调队列
- fzoj Problem 1894 志愿者选拔 【单调队列】
- FZU Problem 1894 志愿者选拔 单调队列
- HDU3706Second My Problem First(单调队列)
- 【单调队列】HDU_3706_Second My Problem First
- poj2823(单调队列队列)
- 单调队列 (POJ2823)
- poj2823(单调队列)
- poj2823(单调队列)
- ssoj1589Pilots(单调队列)
- linux初级学习
- 解题报告: Codeforces Round #305 (Div. 2) E.Mike and Foam (莫比乌斯反演)
- getenv等函数的用法
- c语言 数组元素逆序
- 8.12
- Sticks Problem (单调队列)
- C语言读写文件
- Linux文件系统
- IOS RUNLOOP 深入分析
- JDBC的增、查、改、删
- 【C/C++】string和stringstream
- Xml解析
- H5面试题---&&的使用
- JSP语法