1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T56c,#include using namespace std; int32_t main() { cin.tie(0)->sync_with_stdio(0); int N; cin >> N; vector arr(N), cp; for(int i=0; i> arr[i]; } cp = arr; sort(cp.begin(), cp.end()); cp.erase(unique(cp.begin(), cp.end()), cp.end()); for(auto &a: arr) { a = lower_bound(cp.begin(), cp.end(), a) - cp.begin(); } vector> buk(N); for(int i=0; i buk[j-1].back())) { tmp += buk[j].size(); j++; } if(i) { tmp += lower_bound(buk[i-1].begin(), buk[i-1].end(), buk[i].front()) - buk[i-1].begin(); } if(j < cp.size()) { tmp += buk[j].end() - lower_bound(buk[j].begin(), buk[j].end(), buk[j-1].back()); } ans = min(ans, N - tmp); } cout << ans; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-co

코드 #5010