제출 #1171523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171523		nuutsnoynton	학생 (COCI14_studentsko)	C++20	100 / 100	2 ms	328 KiB

studentsko

#include<bits/stdc++.h>

using namespace std;
using ll = long long;

const ll N = 1e5 + 2;
ll lo[N], hi[N];

int main() {
	ll n, m, r, x, y, lo1, hi1, cnt, s, i, j, ans, t;

	cin >> n >> m;
	
	ll a[n + 2];
	pair < ll, ll > b[n + 2];
	vector < ll > v;
	for (i = 1; i <= n; i ++) {
		cin >> a[i];
		b[i] = {a[i], i};
	}
	
	sort ( b + 1, b + n + 1);
//	reverse(b + 1, b + n + 1);
	for (i = 1; i <= n; i ++) {
		s = (i - 1) / m;
		a[b[i].second] = s;
		
	}
	for (i = 1; i <= n; i ++) {
		if ( v.empty() || v.back() <= a[i] ) {
			v.push_back(a[i]);	
		}
		else {
			r = upper_bound(v.begin(), v.end(), a[i]) - v.begin();
			v[r] = a[i];
		}
	}
	cout << n - v.size() << endl;
}

• 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