제출 #1181770

#제출 시각아이디문제언어결과실행 시간메모리
1181770denizhatipogluMountains (NOI20_mountains)C++20
0 / 100
2094 ms1348 KiB
#include <iostream>

int main(void) {
	int n = 0;
	
	std::cin >> n;

	int* heights = new int[n];

	for (int i = 0; i < n; i++) 
		std::cin >> heights[i];

	int total = 0;
	
	for (int i = 1; i < n - 1; i++) {
		for (int j = 0; j < i; j++) {
			if (heights[j] >= heights[i]) continue;
			for (int k = i + 1; k < n; k++) {
				if (heights[k] >= heights[i]) continue;
				total++;
			}
		}
	}

	std::cout << total << std::endl;

	delete heights;

	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...