This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int ori[500010];
int main(){
ll n,m;
cin>>n>>m;
if(n!=1){
cout<<"0\n";
return 0;
}
for(int i=0;i<m;i++){
cin>>ori[i];
}
ll ans=0;
ll nowc=2;
for(int i=2;i<m;i++){
if((ori[i]>ori[i-1])^(ori[i-1]>ori[i-2])){
ans+=nowc*(nowc-1)/2+nowc-1;
nowc=2;
}else{
nowc++;
}
}
ans+=nowc*(nowc-1)/2+nowc;
cout<<ans<<'\n';
return 0;
}
# | 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... |