```cpp
#include<bits/stdc++.h>
using namespace std;
int a[10005];
int main()
{
int n,ans=0,t;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
int s=1;
for(int i=3;i<=n-2;i++)
{
if(a[i-1]>=a[i]&&a[i+1]>=a[i])
{
if(a[i-1]>=a[i+1])
{
t=i+1;
if(a[i+2]==0)
{
s=1;
int j=i;
while(a[j+1]==0)
{
s++;
j++;
if(a[j-1]>=a[j+1])
t=a[j+1];
else
t=a[i-1];
}
}
ans=ans+s*a[t];
}
else
if(a[i-1]<a[i+1])
{
t=i-1;
if(a[i+2]==0)
{
s=1;
int j=i;
while(a[j+1]==0)
{
s++;
j++;
if(a[j-1]>=a[j+1])
t=a[j+1];
else
t=a[i-1];
}
}
ans=ans+s*a[t];
}
}
}
cout<<ans;
}```
by 旴谨 @ 2018-09-27 22:42:52
希望更丰富的展现？[使用Markdown](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown)
by Jaanai @ 2018-09-27 22:42:58
@[旴谨](/space/show?uid=113218) 没看见重发不好意思
by Jaanai @ 2018-09-27 22:43:20