제출 #122126

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122126		Sorting	모임들 (IOI18_meetings)	C++14	4 / 100	5567 ms	1204 KiB

meetings

#include <bits/stdc++.h>

using namespace std;

const long long inf = 1e18;

int n;

vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R){
	n = (int)H.size();

	vector<long long> ret;

	for(int i = 0; i < (int)L.size(); i++){
		int l = L[i], r = R[i];

		long long ans = inf;

		for(int j = l; j <= r; j++){
			long long curr = 0;

			long long mx = 0;
			for(int k = j; k <= r; k++){
				mx = max(mx, (long long)H[k]);

				curr += mx;
			}

			mx = H[j];
			for(int k = j - 1; k >= l; k--){
				mx = max(mx, (long long)H[k]);

				curr += mx;
			}

			ans = min(ans, curr);
		}

		ret.push_back(ans);
	}

	return ret;
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40