Submission #1182004

#TimeUsernameProblemLanguageResultExecution timeMemory
1182004denizhatipogluMountains (NOI20_mountains)C++20
0 / 100
2096 ms1352 KiB
#include <iostream> int main(void) { int n = 0; std::cin >> n; int* H = new int[n]; for (int i = 0; i < n; i++) std::cin >> H[i]; long long int total = 0; for (int i = 0; i < n - 2; i++) { for (int j = i + 1; j < n - 1; j++) { if (H[j] <= H[i]) continue; for (int k = j + 1; k < n; k++) { if (H[k] >= H[j]) continue; total++; } } } std::cout << total << std::endl; delete H; return 0; }
#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...