제출 #832768

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832768		DarkMatter	학생 (COCI14_studentsko)	C++14	100 / 100	35 ms	416 KiB

studentsko

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int>pi;
typedef pair<ll, ll>pl;
typedef vector<pi>vpi;
typedef vector<pl>vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<bool> vb;
const long double PI = acos(-1);
const ll oo = 1e18;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
#define endl '\n'
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define read(v) for (auto& it : v) scanf("%d", &it);
#define readL(v) for (auto& it : v) scanf("%lld", &it);
#define print(v) for (auto it : v) printf("%d ", it); puts("");
#define printL(v) for (auto it : v) printf("%lld ", it); puts("");
void solve() {
	int n, k;
	scanf("%d %d", &n, &k);
	vpi v(n);
	vi a(n), dp(n, 1);
	for (int i = 0; i < n; i++) {
		scanf("%d", &v[i].first);
		v[i].second = i;
	}
	sort(all(v));
	int ans = 1e9;
	for (int i = 0; i < n; i++)
		a[v[i].second] = i / k;
	for (int i = 0; i < n; i++) {
		for (int j = i - 1; j >= 0; j--)
			if (a[j] <= a[i])
				dp[i] = max(dp[i], dp[j] + 1);
		ans = min(ans, n - dp[i]);
	}
	printf("%d\n", ans);
}
int t = 1;
int main() {
	//#ifndef ONLINE_JUDGE
	//	freopen("input.txt", "r", stdin);
	//#endif
		//scanf("%d", &t);
	while (t--) solve();
}

컴파일 시 표준 에러 (stderr) 메시지

studentsko.cpp: In function 'void solve()':
studentsko.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  scanf("%d %d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~
studentsko.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   scanf("%d", &v[i].first);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

• 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