제출 #290637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290637		shrek12357	학생 (COCI14_studentsko)	C++14	10 / 100	29 ms	760 KiB

studentsko

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
//#include "gondola.h"
using namespace std;

#define MAXN 5005

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> order;
	vector<int> groups;
	for (int i = 0; i < n; i++) {
		int temp;
		cin >> temp;
		groups.push_back(temp);
		order.push_back(temp);
	}
	sort(groups.begin(), groups.end());
	map<int, int> g;
	for(int i = 0; i < n; i++){
		g[groups[i]] = i / k;
	}
	for (int i = 0; i < n; i++) {
		order[i] = g[order[i]];
	}
	int dp[MAXN];
	for (int i = 0; i < n; i++) {
		dp[i] = 1;
		for (int j = 0; j < i; j++) {
			int temp = 0;
			if (order[i] >= order[j]) {
				temp = 1;
			}
			dp[i] = max(dp[i], dp[j] + temp);
		}
	}
	cout << n-dp[n - 1] << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10