这道题目看似很容易,找到比当前边i长的边且位于整个数组的最左边,存储在l[i],同理比当前边长且位于最右边的存储在r[i],于是我照做了,果断TL。。。所以需要优化,这道题目有点像并查集,如果当前边i比左边的边i-1短,那么就可以把左边边的l[i-1]赋给它,其实就是这样一个思路。
题目链接:https://vjudge.net/problem/HDU-1506
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 100005;
__int64 G[maxn];
int n;
__int64 l[maxn] , r[maxn];
int main () {
while(scanf("%d" , &n) != EOF && n) {
__int64 ans = 0;
for (int i = 1 ; i <= n ; i++) {
scanf("%I64d" , &G[i]);
l[i] = r[i] = i;
}
for (int i = 1 ; i <= n ; i++)
while (l[i] >= 2 && G[l[i]-1] >= G[i])
l[i] = l[l[i]-1];
for (int i = n ; i >= 1 ; i--)
while (r[i] <= n-1 && G[r[i]+1] >= G[i])
r[i] = r[r[i]+1];
for (int i = 1 ; i <= n ; i++)
ans = max(ans , (r[i]-l[i]+1)*G[i]);
printf("%I64d\n" , ans);
}
}