19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T648,#include #include #include #include #include #include #define INF 987654321 #define lld long long using namespace std; int n, m; vector v[2]; vector answer; void update(vector w) { vector ret; while(!w.empty()) { if(!ret.empty() && ret.back() <= w.back()) { ret.push_back(w.back()); } else if(ret.empty()) { ret.push_back(w.back()); } w.pop_back(); } for(int i = 0; i < ret.size() / 2; i++) { swap(ret[i], ret[ret.size()-i-1]); } for(int i = 0; i < min(answer.size(), ret.size()); i++) { if(answer[i] < ret[i]) { answer = ret; return; } } if(answer.size() < ret.size()) { answer = ret; return; } } vector solve(int a, int b, vector& s) { update(s); for(int i = a; i < n; i++) { for(int j = b; j < m; j++) { if(v[0][i] == v[1][j]) {

제출 #25078

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: