【Luogu】UVA1619 Feel Good

Feel Good

Link

---

解题思路

预处理出每个点可以作为最小值的区间的左右端点。

code

#include<iostream>
#include<cstring>
#include<cstdio>
#define int long long
using namespace std;

int n;
int a[100010];
int b[100010];
int r[100010];
int l[100010];
int z[100010],top;

void ycl()
{
	for(int i=1;i<=n;i++)
	{
		while(a[i]<a[z[top]]&&top) r[z[top--]]=i-1;
		z[++top]=i;
	}
	while(top) r[z[top--]]=n;
	for(int i=n;i;i--)
	{
		while(a[i]<a[z[top]]&&top) l[z[top--]]=i+1;
		z[++top]=i;
	}
	while(top) l[z[top--]]=1;
}

signed main()
{
	int T=0;
	while(scanf("%lld",&n)!=EOF)
	{
		memset(b,0,sizeof(b));
		memset(z,0,sizeof(z));
		memset(l,0,sizeof(l));
		memset(r,0,sizeof(r));
		if(T++) printf("\n");
		for(int i=1;i<=n;i++)
			scanf("%lld",&a[i]),b[i]=b[i-1]+a[i];
		ycl();
//		for(int i=1;i<=n;i++)
//			printf("%d %d\n",l[i],r[i]);
		int maxn=0,ansl=1,ansr=1;
		for(int i=1;i<=n;i++)
		{
			int now=a[i]*(b[r[i]]-b[l[i]-1]);
			if(now>maxn||(now==maxn&&r[i]-l[i]<ansr-ansl))
			{
				maxn=now;
				ansl=l[i],ansr=r[i];
			}
		}
		printf("%lld\n%lld %lld\n",maxn,ansl,ansr);
	}
	return 0;
}