CodeForces 602B Approximating a Constant Range(RMQ)
来源:互联网 发布:java 数据结构面试题 编辑:程序博客网 时间:2024/06/07 09:58
题意:给你n个数,要求你找到最长的区间,使得这个区间的最大值减去最小值之差的绝对值小于等于1
思路:枚举每一个数,以这个数为这个区间的最小值,能够往左边延伸多少,往右边延伸多少,再枚举每一个数,以这个数为区间的最大值,能够往左边延伸多少,往右边延伸多少就好了
#include<bits\stdc++.h>using namespace std;const int maxn = 100000+100;int n;int L[maxn],R[maxn];int dmax[maxn][20];int dmin[maxn][20];int d[maxn];void initmax(int n,int d[]){for (int i = 1;i<=n;i++)dmax[i][0]=d[i];for (int j = 1;(1<<j)<=n;j++)for (int i = 1;i+(1<<j)-1<=n;i++)dmax[i][j]=max(dmax[i][j-1],dmax[i+(1<<(j-1))][j-1]);}int getmax(int L,int R){int k = 0;while ((1<<(k+1)) <= R-L+1)k++;return max(dmax[L][k],dmax[R-(1<<k)+1][k]);}void initmin(int n,int d[]){for (int i = 1;i<=n;i++)dmin[i][0]=d[i];for (int j = 1;(1<<j)<=n;j++)for (int i = 1;i+(1<<j)-1<=n;i++)dmin[i][j]=min(dmin[i][j-1],dmin[i+(1<<(j-1))][j-1]);}int getmin(int L,int R){int k = 0;while ((1<<(k+1)) <= R-L+1)k++;return min(dmin[L][k],dmin[R-(1<<k)+1][k]);}int main(){ int q;int ans = 0;scanf("%d",&n);for(int i = 1;i<=n;i++)scanf("%d",&d[i]); initmax(n,d);initmin(n,d); for(int i = 1;i<=n;i++){int l = 1,r=i;while(l<=r){int m = (l+r)>>1;if (abs(d[i]-getmin(m,i))<=0 && abs(d[i]-getmax(m,i))<=1)r=m-1;elsel=m+1;}L[i]=l; l=i,r=n;while(l<=r){int m = (l+r)>>1;if (abs(d[i]-getmin(i,m))<=0&&abs(d[i]-getmax(i,m))<=1)l=m+1;elser=m-1;}R[i]=l-1;}for(int i = 1;i<=n;i++)ans = max(ans,R[i]-L[i]+1);printf("%d\n",ans);}
0 0
- Codeforces 602B Approximating a Constant Range(RMQ)
- CodeForces 602B Approximating a Constant Range(RMQ)
- Codeforces 602B Approximating a Constant Range
- Codeforces 602B Approximating a Constant Range
- Coderforce 602B Approximating a Constant Range(RMQ)
- Approximating a Constant Range(RMQ)
- Codeforces 602B Approximating a Constant Range 【dp + 二分】
- [CodeForces 602B]Approximating a Constant Range[构造]
- 【32.22%】【codeforces 602B】Approximating a Constant Range
- Codeforces 602B - Approximating a Constant Range(DP)
- Coderforce 602B Approximating a Constant Range
- codeforec 602B Approximating a Constant Range
- codeforces 602B Approximating a Constant Range(线段树+尺取法)
- CodeForces 602 B.Approximating a Constant Range(尺取+set)
- 602B - Approximating a Constant Range (STL 贪心)
- Approximating a Constant Range CodeForces
- CF#333(Div2)B. Approximating a Constant Range(RMQ)
- Codeforces Round #333 (Div. 2) B. Approximating a Constant Range
- 从头认识多线程-2.21 死锁简介
- Gym 100712H Bridges
- netstat命令
- LeetCode insertion-sort-list
- Android中最基本的组件--活动(Activity)
- CodeForces 602B Approximating a Constant Range(RMQ)
- leetcode笔记—容纳最多水的容器
- es6
- HydroCMS完成项目标签功能和自定义目录修改功能
- js取小数点后两位的方法
- Android事件传递机制
- String、StringBuffer与StringBuilder之间区别
- 分组取前N记录
- 背包问题之4