[分治 || 单调栈 单调队列] 51Nod 1215 数组的宽度

分治

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef pair<int,int> abcd;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=50005;

int n;
int a[N];
int Max[N],Min[N];
ll smax[N],smin[N];
int tmp[N];

inline ll Solve(int l,int r){
  if (l==r) return 0LL;
  ll ret=0; int mid=(l+r)>>1;
  ret+=Solve(l,mid); ret+=Solve(mid+1,r);
  smax[mid+1]=Max[mid+1]=a[mid+1]; smin[mid+1]=Min[mid+1]=a[mid+1];
  for (int i=mid+2;i<=r;i++){
    Max[i]=max(Max[i-1],a[i]); smax[i]=smax[i-1]+Max[i];
    Min[i]=min(Min[i-1],a[i]); smin[i]=smin[i-1]+Min[i];
  }
  smax[mid]=smin[mid]=0;
  for (int i=mid+1;i<=r;i++) tmp[i]=Min[i];
  reverse(tmp+mid+1,tmp+r+1);
  int maxv=0,minv=1<<30;
  for (int i=mid;i>=l;i--){
    maxv=max(maxv,a[i]),minv=min(minv,a[i]);
    int pos1=upper_bound(Max+mid+1,Max+r+1,maxv)-Max;
    int pos2=lower_bound(tmp+mid+1,tmp+r+1,minv)-tmp-1;
    pos2=r-(pos2-mid-1);
    if (pos1<pos2){
      if (mid+1<=pos1-1)
	ret+=(ll)(pos1-1-mid-1+1)*(maxv-minv);
      if (pos1<=pos2-1)
	ret+=(smax[pos2-1]-smax[pos1-1])-(ll)(pos2-1-pos1+1)*minv;
      if (pos2<=r)
	ret+=(smax[r]-smax[pos2-1])-(smin[r]-smin[pos2-1]);
    }else{
      if (mid+1<=pos2-1)
	ret+=(ll)(pos2-1-mid-1+1)*(maxv-minv);
      if (pos2<=pos1-1)
	ret+=(ll)(pos1-1-pos2+1)*maxv-(smin[pos1-1]-smin[pos2-1]);
      if (pos2<=r)
	ret+=(smax[r]-smax[pos1-1])-(smin[r]-smin[pos1-1]);
    }
  }
  return ret;
}

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n);
  for (int i=1;i<=n;i++) read(a[i]);
  printf("%lld\n",Solve(1,n));
  return 0;
}

单调栈求出每个点作为最大最小值的范围

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef pair<int,int> abcd;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=50005;

int n,a[N]; ll ans=0;
int maxl[N],maxr[N];
int minl[N],minr[N];
int Stack[N],pnt;

int main(){
  freopen("t.in","r",stdin);
  freopen("t1.out","w",stdout);
  read(n);
  for (int i=1;i<=n;i++) read(a[i]);
  
  pnt=0; Stack[++pnt]=1;
  for (int i=2;i<=n;i++){
    while (pnt && a[i]>=a[Stack[pnt]]) maxr[Stack[pnt]]=i-1,pnt--;
    Stack[++pnt]=i;
  }
  while (pnt) maxr[Stack[pnt]]=n,pnt--;

  pnt=0; Stack[++pnt]=n;
  for (int i=n-1;i;i--){
    while (pnt && a[i]>a[Stack[pnt]]) maxl[Stack[pnt]]=i+1,pnt--;
    Stack[++pnt]=i;
  }
  while (pnt) maxl[Stack[pnt]]=1,pnt--;

  pnt=0; Stack[++pnt]=1;
  for (int i=2;i<=n;i++){
    while (pnt && a[i]<=a[Stack[pnt]]) minr[Stack[pnt]]=i-1,pnt--;
    Stack[++pnt]=i;
  }
  while (pnt) minr[Stack[pnt]]=n,pnt--;

  pnt=0; Stack[++pnt]=n;
  for (int i=n-1;i;i--){
    while (pnt && a[i]<a[Stack[pnt]]) minl[Stack[pnt]]=i+1,pnt--;
    Stack[++pnt]=i;
  }
  while (pnt) minl[Stack[pnt]]=1,pnt--;
  
  for (int i=1;i<=n;i++){
    ans+=(ll)(maxr[i]-i+1)*(i-maxl[i]+1)*a[i];
    ans-=(ll)(minr[i]-i+1)*(i-minl[i]+1)*a[i];
  }
  printf("%lld\n",ans);
  return 0;
}