Submission #1181988

#TimeUsernameProblemLanguageResultExecution timeMemory
1181988ostiMountains (NOI20_mountains)C++20
0 / 100
2095 ms2560 KiB
#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(){ long long int a; cin >> a; long long int b; long long int p=0; vector<int> dag{}; for(p=0;p<a;p++){ cin >> b; dag.push_back(b); } long long int k=0; long long int l=1; long long int m=2; long long int x=dag[k]; long long int y=dag[l]; long long int z=dag[m]; int t=3; long long int s= combination(a, t); long long int h=0; long long 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...