POJ 2452 Sticks Problem
来源:互联网 发布:淘宝售假扣保证金 编辑:程序博客网 时间:2024/05/28 03:03
Sticks Problem
Time Limit: 6000MS Memory Limit: 65536KTotal Submissions: 10282 Accepted: 2723
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.
Line 1: a single integer n (n <= 50000), indicating the number of sticks.
Line 2: n different positive integers (not larger than 100000), indicating the length of each stick in order.
Line 1: a single integer n (n <= 50000), indicating the number of sticks.
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
POJ Monthly,static
题意:找到一个最长的区间,这个区间中间每个数字都要小于末尾的数,并且要大于区间开头的数,输出符合要求的最大区间长度
思路:先记录每一位数后面连续大于这个数的长度,然后再这个长度里找最大的数,这样可求得最大的区间
#include <cstdio>using namespace std;int a[50001], dis[50001];int main(){ int n, flag, i, j, maxn, ans; while (scanf("%d", &n)!= EOF){ ans = 0; for (i = 1; i <= n; i++){ scanf("%d", &a[i]); dis[i] = 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){ maxn = flag = -1; for (j = 0; j < dis[i]; j++){ if (a[i + j] > maxn){ maxn = a[i + j]; flag = j; } } if (flag > ans) ans = flag; } if(ans) printf("%d\n", ans); else printf("-1\n"); } return 0;}
0 0
- poj 2452 Sticks Problem
- POJ 2452 Sticks Problem
- poj 2452 Sticks Problem
- POJ 2452 Sticks Problem
- poj 2452 RMQ(Sticks Problem)
- POJ 2452 Sticks Problem [RMQ+二分]
- POJ 2452 Sticks Problem(二分+RMQ)
- POJ 2452 Sticks Problem(二分+RMQ)
- POJ 2452 Sticks Problem(RMQ+二分)
- poj-2452 Sticks Problem(二分+RMQ)
- POJ 2452 Sticks Problem (RMQ + 预处理)
- POJ 2452 Sticks Problem(ST+二分查找)
- Sticks Problem
- Sticks POJ
- Sticks POJ
- Sticks POJ
- Sticks POJ
- pku 2455 Sticks Problem
- Spark集群搭建——SSH免密码验证登陆
- JPA & Hibernate 注解
- Spark中的编程模型
- 垃圾车定律
- Spark源码分析之Worker
- POJ 2452 Sticks Problem
- DICOM文件下载
- Spark RDD详解
- static 和const关键字的用法总结
- RPC简介与Thrift框架
- 详细探究Spark的shuffle实现
- Tomcat启动报Error listenerStart错误
- preempt_enable 和 preempt_disable
- 开源分布式计算框架(DC4C)