#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
int n;
vector<ll> height(300001);
vector<int> lower_l(300001,0);
vector<int> lower_r(300001,0);
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++)cin>>height[i];
vector<ll> tem1,tem2;
for(int i=2;i<=n;i++)
{
tem1.insert(upper_bound(tem1.begin(),tem1.end(),height[i-1]),height[i-1]);
lower_l[i]=lower_bound(tem1.begin(),tem1.end(),height[i])-tem1.begin();
}
for(int i=n-1;i>=1;i--)
{
tem2.insert(upper_bound(tem2.begin(),tem2.end(),height[i+1]),height[i+1]);
lower_r[i]=lower_bound(tem2.begin(),tem2.end(),height[i])-tem2.begin();
}
ll res=0;
for(int i=1;i<=n;i++)res+=lower_l[i]*lower_r[i];
cout<<res;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4972 KB |
Output is correct |
2 |
Execution timed out |
2075 ms |
9364 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2073 ms |
7276 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2073 ms |
7276 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4972 KB |
Output is correct |
2 |
Correct |
4 ms |
4972 KB |
Output is correct |
3 |
Correct |
4 ms |
4972 KB |
Output is correct |
4 |
Correct |
4 ms |
4972 KB |
Output is correct |
5 |
Correct |
4 ms |
4972 KB |
Output is correct |
6 |
Correct |
4 ms |
4972 KB |
Output is correct |
7 |
Correct |
4 ms |
4972 KB |
Output is correct |
8 |
Correct |
4 ms |
4972 KB |
Output is correct |
9 |
Correct |
4 ms |
4972 KB |
Output is correct |
10 |
Correct |
3 ms |
4972 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4972 KB |
Output is correct |
2 |
Correct |
4 ms |
4972 KB |
Output is correct |
3 |
Correct |
4 ms |
4972 KB |
Output is correct |
4 |
Correct |
4 ms |
4972 KB |
Output is correct |
5 |
Correct |
4 ms |
4972 KB |
Output is correct |
6 |
Correct |
4 ms |
4972 KB |
Output is correct |
7 |
Correct |
4 ms |
4972 KB |
Output is correct |
8 |
Correct |
4 ms |
4972 KB |
Output is correct |
9 |
Correct |
4 ms |
4972 KB |
Output is correct |
10 |
Correct |
3 ms |
4972 KB |
Output is correct |
11 |
Correct |
25 ms |
5356 KB |
Output is correct |
12 |
Correct |
25 ms |
5356 KB |
Output is correct |
13 |
Correct |
28 ms |
5356 KB |
Output is correct |
14 |
Correct |
25 ms |
5356 KB |
Output is correct |
15 |
Correct |
32 ms |
5356 KB |
Output is correct |
16 |
Correct |
25 ms |
5356 KB |
Output is correct |
17 |
Correct |
26 ms |
5356 KB |
Output is correct |
18 |
Correct |
25 ms |
5356 KB |
Output is correct |
19 |
Correct |
31 ms |
5356 KB |
Output is correct |
20 |
Correct |
4 ms |
4972 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2073 ms |
7276 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4972 KB |
Output is correct |
2 |
Execution timed out |
2075 ms |
9364 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |