제출 #337470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337470		zapan4	Mountains (NOI20_mountains)	C++17	64 / 100	2075 ms	2796 KiB

Mountains

#include <iostream>
#include <cmath> 
#include <stdio.h>
#include <array>
#include <vector>
#include <list>
#include <algorithm>
#include <utility>
#include <string>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#define pp pair<int,int>
#define pll pair<ll, ll>
#define ll long long
using namespace std;

int main() {
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	ll n;
	cin >> n;
	ll mountains[n];
	for (int i = 0; i < n; i++) {
		cin >> mountains[i];
	}
	ll answer = 0;
	for (int i = 1; i < n-1; i++) {
		ll counter = 0;
		for (int j = 0; j < i; j++) {
			if (mountains[j] < mountains[i]) {
				counter++;
			}
		}
		ll counter1 = 0;
		for (int k = i+1; k < n; k++) {
			if (mountains[k] < mountains[i]) {
				counter1++;
			}
		}
		answer += (counter1)*counter;
	}
	cout << answer << endl;
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 36 / 36
• Subtask 5: 28 / 28
• Subtask 6: 0 / 9
• Subtask 7: 0 / 12