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:T72b,#include using namespace std; using ll=long long; using pii=pair; using pll=pair; vector dir; int MAX; int n; //idx에 가장 키 큰애를 배치했을떄 //좌측은 왼쪽 바라보는 애들중 키큰애들 //우측은 오른쪽 바라보는애들중 키큰애들 int solve(int idx, deque left, deque right){ vector arr(n); for(int i=0;i=idx;i--){ if(dir[i] == 'R'){ arr[i] = right.front(); right.pop_front(); } if(dir[i] == 'L'){ arr[i] = left.front(); left.pop_front(); } } for(int i=0;i prefix) cnt++; prefix = max(prefix, arr[i]); } int suffix = 0; for(int i=n-1;i>=0;i--){ if(dir[i] == 'R' && arr[i] > suffix) cnt++; suffix = max(suffix, arr[i]); } return cnt; } int main(){ cin.tie(0) -> sync_with_stdio(0); cin>>n; dir.resize(n); deque left,right; for(int i=0;i>a>>b;

코드 #6523