Submission #276922

#	Time	Username	Problem	Language	Result	Execution time	Memory
276922		wutwere	Studentsko (COCI14_studentsko)	C++17	100 / 100	162 ms	512 KiB

studentsko

#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int n, k; cin >> n >> k;
	vector<int> v(n);
	for (int i = 0; i < n ; i++)
		cin >> v[i];
	vector<int> sortedv = v;
	sort(sortedv.begin(), sortedv.end());
	for (int i = 0; i < n / k; i++) {
		set<int> s;
		for (int j = 0; j < k; j++) {
			s.insert(sortedv[i * k + j]);
		}
		int p = 0;
		for (int j = 0; j < n; j++) {
			if (s.count(v[j])) {
				v[j] = sortedv[i * k + p];
				p++;
			}
		}
	}
	vector<int> dp(n, 1);
	int longest = 1;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < i; j++) {
			if (v[i] > v[j]) {
				dp[i] = max(dp[i], dp[j] + 1);
			}
		}
		longest = max(longest, dp[i]);
	}
	cout << n - longest;
}

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