์๊ณ ๋ฆฌ์ฆ
-
LIS๋ฅผ ๊ตฌํ๊ณ , LIS๋ฅผ ๊ตฌ์ฑํ์ง ์๋ ์์๋ค๋ง ๋ฐฐ์นํด์ฃผ๋ฉด ๋จ
-
LIS๋ฅผ ๊ตฌํ๋ ๋ฐฉ๋ฒ์ผ๋ก n์ด ์ต๋ 200์ด๋ O(n^2)์ ์จ๋ ์ถฉ๋ถํจ
-
LIS ๊ตฌํ๋ ์ฝ๋ O(n^2)
- ์ด์ ์์๋ค ์ค์ ์๊ธฐ๋ณด๋ค ์์ ๊ฒ ์ค, ๊ฐ์ฅ ํฐ LIS๋ฅผ ๊ฐ์ง ์์์ ์ด์ด ๋ถ์
for (int i = 1; i <= n; i++) { save[i] = 1; for (int j = 1; j < n; j++) { if (nums[j] < nums[i]) save[i] = max(save[i], save[j] + 1); } ans = max(ans, save[i]); }
-
์ฝ๋
#include <iostream>
using namespace std;
int n, nums[220], ans, save[220];
int max(int a, int b) {
return a > b ? a : b;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> nums[i];
for (int i = 1; i <= n; i++) {
save[i] = 1;
for (int j = 1; j < n; j++) {
if (nums[j] < nums[i])
save[i] = max(save[i], save[j] + 1);
}
ans = max(ans, save[i]);
}
cout << n - ans;
}