标签：
既然所有数都是大于等于0的，那么在一个区间最小值一定的情况下，这个区间越长越好（当然有特殊情况）1 6
#include<cstdio>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn = 100005;
int n;
stack<int>s;
LL arr[maxn];
int left[maxn],right[maxn];
LL sum[maxn];
void solve1(){
while(!s.empty()) s.pop();
for(int i = 1; i <= n; i++){
LL e = arr[i];
do{
if(s.empty()){
left[i] = 0;
s.push(i);
break;
}
LL c = arr[s.top()];
if(c < e){
left[i] = s.top();
s.push(i);
break;
}
else s.pop();
}while(true);
}
}
void solve2(){
while(!s.empty()) s.pop();
for(int i = n; i >= 1; i--){
LL e = arr[i];
do{
if(s.empty()){
right[i] = n + 1;
s.push(i);
break;
}
LL c = arr[s.top()];
if(c < e){
right[i] = s.top();
s.push(i);
break;
}
else s.pop();
}while(true);
}
}
int main(){
int Case = 0;
while(scanf("%d",&n) != EOF){
sum[0] = 0L;
for(int i = 1; i <= n; i++){
scanf("%lld",&arr[i]);
sum[i] = sum[i - 1] + arr[i];
}
solve1();
solve2();
LL ans = -1;
int pos_x,pos_y;
int l;
for(int i = 1; i <= n; i++){
int a = left[i];
int b = right[i];
int ll = (b - 1) - (a + 1);
LL max_sum = (sum[b - 1] - sum[a]) * arr[i];
if(max_sum > ans){
pos_x = a + 1;
pos_y = b - 1;
l = pos_y - pos_x;
ans = max_sum;
}
else if(max_sum == ans && ll < l){
pos_x = a + 1;
pos_y = b - 1;
l = pos_y - pos_x;
}
}
if(Case++) puts("");
printf("%lld\n",ans);
if(ans == 0)
printf("%d %d\n",pos_x,pos_x);
else
printf("%d %d\n",pos_x,pos_y);
}
return 0;
}
标签：
原文地址：http://blog.csdn.net/u013451221/article/details/44807629
