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:T53e,#include using namespace std; #define int long long using pii = pair; int dp[100020]; int psum[100020]; priority_queue, greater> pq; int32_t main() { cin.tie(0)->sync_with_stdio(0); int N; cin >> N; vector values(N); for(int i=0; i> values[i]; pq.push({0, -1}); psum[0] = 0; for(int i=0; i max_idx) { max_idx = top.second; max_val = top; } } else break; } // cout << "i: " << max_idx << endl; if(max_idx != -1) { dp[i] = psum[i+1] - psum[max_idx+1]; pq.push(max_val); } else { dp[i] = psum[i+1]; } pq.push({dp[i]+psum[i+1], i}); } // for(int i=0; i0; i--) { if(psum[N]-psum[i] < dp[i-1]) { ans = min(ans, dp[i-1]); } } cout << ans; }5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":

코드 #5241