@[Jason12](/user/169606) ``` ` ` ` ```
在冒号后面要换行啊……
重发一遍代码吧
by Justin090102 @ 2021-12-31 22:22:13
```
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a[100001],b,c,s=0;
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>a[i];
}
for (int i=1;i<n;i++)
{
for (int j=i+1;j<=n;j++)
{
if (a[i]>a[i+1])
{
b=a[i];
c=a[i+1];
}
else
{
b=a[i+1];
c=a[i];
}
if (j>i+1)
{
for (int k=i+2;k<=j;k++)
{
if (a[k]>=b)
{
c=b;
b=a[k];
}
else if (a[k]<b && a[k]>c) c=a[k];
}
}
s=s+c;
}
}
cout<<s<<endl;
return 0;
}
```
by Jason12 @ 2021-12-31 22:26:01
@[Justin090102](/user/360338) sorry
by Jason12 @ 2021-12-31 22:26:38
@[Jason12](/user/169606)
应当枚举f(l,r)的值(1~n-1)，算出每种f(l,r)的方案数，乘起来相加，话说这答案应该要用long long吧。
by wangminxiao2019 @ 2021-12-31 22:38:28
@[wangminxiao2019](/user/243340) 谢谢大佬Thanks♪(･ω･)ﾉ
~~可是大佬前半句我看不懂啊~~o(╥﹏╥)o
by Jason12 @ 2021-12-31 22:51:36
有大佬帮忙看一下吗？
by Jason12 @ 2022-01-02 20:17:25