1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"CodeViewer"] 1c:T5e1,#include using namespace std; #define int long long vector S, E, A; int M, N, R; bool ok(int i, int j) { if(i > j) swap(i, j); return i + R >= j; } vector> ans; void apply(int from, int to) { if(from == to) return; bool rev = 0; if(from > to) { swap(from, to); rev = 1; } int cur = from; vector> v; for(int i=from, j=from; isync_with_stdio(0); cin >> M >> N >> R; S.resize(M+1); E.resize(M+1); A.resize(N+1); for(int i=1; i<=N; i++) { cin >> A[i]; } for(int i=0; i> S[i]; } for(int i=0; i> E[i]; } for(int i=0, j=0; i=i; t--) { apply(S[t], E[t]); } } else { for(int t=i; t

코드 #6090