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:T618,#include using namespace std; struct info { int l, r, v; }; int32_t main() { cin.tie(0)->sync_with_stdio(0); int M, N; cin >> M >> N; vector colors(N), pos(N), dp(N); for(int i = 0; i < N; i++) { cin >> pos[i]; } for(int i = 0; i < N; i++) { cin >> colors[i]; } int i; for(i=0; i st; vector v; for(int x=i-1; x>=0 && colors[x] == colors[i-1]; x--) { int a = pos[i-1] - pos[x], b = pos[i] - pos[x]; v.push_back({pos[x] + a*2, pos[x] + b*2, dp[x]}); } int l = 0, r = 0; int lst = 0; while(t < N && colors[i] == colors[t]) { while(r < v.size() && v[r].l <= pos[t]) { st.insert(v[r].v); r++; } while(l < v.size() && v[l].r < pos[t]) { st.erase(st.find(v[l].v)); l++; } if(lst < l) { lst = l; } while(lst < r) { gmin = min(gmin, v[lst].v); lst++; } dp[t] = gmin + 2; if(st.size()) { dp[t] = min(dp[t], *st.begin() + 1); } t++; } } int ans = dp[N-1]; i = N-1; while(i >=

코드 #4898