题目链接:点击打开链接
思路:
问题简化一下就是, 求任意一个数后面大于等于它的数中距离它的最远距离。 因为有两个特征:“大小”, “距离”, 我们可以用线段树下标表示数的大小, 距离作为值, 就变成了求区间最大值的问题了。
细节参见代码:
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <ctime>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std;
typedef long long ll;
typedef long double ld;
const double eps = 1e-6;
const double PI = acos(-1);
const int mod = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
// & 0x7FFFFFFF
const int seed = 131;
const ll INF64 = ll(1e18);
const int maxn = 50000 + 10;
int T,n,m, maxv[maxn<<2], a[maxn], x[maxn];
void pushup(int o) {
maxv[o] = max(maxv[o<<1], maxv[o<<1|1]);
}
void build(int l, int r, int o) {
maxv[o] = 0;
if(l == r) return ;
int m = (l + r) >> 1;
build(l, m, o<<1);
build(m+1, r, o<<1|1);
}
void update(int L, int R, int v, int l, int r, int o) {
if(L <= l && r <= R) {
maxv[o] = v; return ;
}
int m = (l + r) >> 1;
if(L <= m) update(L, R, v, l, m, o<<1);
if(m < R) update(L, R, v, m+1, r, o<<1|1);
pushup(o);
}
int query(int L, int R, int l, int r, int o) {
if(L <= l && r <= R) {
return maxv[o];
}
int m = (l + r) >> 1;
int ans = 0;
if(L <= m) ans = max(ans, query(L, R, l, m, o<<1));
if(m < R) ans = max(ans, query(L, R, m+1, r, o<<1|1));
return ans;
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
x[i-1] = a[i];
}
sort(x, x+n);
int len = unique(x, x+n) - x;
build(1, len, 1);
for(int i = 1; i <= n; i++) {
int pos = lower_bound(x, x+len, a[i]) - x + 1;
update(pos, pos, i, 1, len, 1);
}
int ans = 0;
for(int i = 1; i <= n; i++) {
int pos = lower_bound(x, x+len, a[i]) - x + 1;
int cur = query(pos, len, 1, len, 1);
ans = max(ans, cur - i);
update(pos, pos, 0, 1, len, 1);
}
printf("%d\n", ans);
return 0;
}