#include <bits/stdc++.h>
using namespace std;
long long combination(int a, int t) {
if (t > a - t)
t = a - t;
long long result = 1;
for (int i = 1; i <= t; i++) {
result *= a - t + i;
result /= i;
}
return result;
}
int main(){
int a; cin >> a;
int b;
int p=0;
vector<int> dag{};
for(p=0;p<a;p++){
cin >> b;
dag.push_back(b);
}
int k=0;
int l=1;
int m=2;
int x=dag[k];
int y=dag[l];
int z=dag[m];
int t=3;
int s= combination(a, t);
int h=0;
int sayac=0;
do{
if(x<y && z<y) sayac=sayac+1;
if(m!=a-1) m++;
else{
if(l!=a-2){l++; m=l+1;}
else{
if(k!=a-3){k++; l=k+1; m=k+2;}
}
}
x=dag[k];
y=dag[l];
z=dag[m];
h++;
}while(h<s);
cout << sayac;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |