#include #include using namespace std; void print (const vector& vi) { for (int i : vi) cout << i << " "; cout << endl; } bool is_AafterB(const vector& A, const vector& B) { int N = min(A.size(), B.size()); for (int i = 0; i < N; i++) { if (A[i] > B[i]) return true; else if (A[i] < B[i]) return false; } return ((A.size() > B.size()) ? true : false); } bool has_CS(const vector& B, vector& seq) { int i = 0; for (int b : B) { if (b == seq[i]) i++; } return (i == seq.size()); } void find_CS(int start, const vector& A, const vector& B, vector& MCS, vector& seq, int N) { if (N == 0) { if (has_CS(B, seq)) { if (is_AafterB(seq, MCS)) { MCS = seq; } } return; } for (int i = start; i < A.size(); i++) { seq.push_back(A[i]); // printf("#1 start : %d, A[%d] = %d ", start, i, A[i]); print(seq); find_CS(i + 1, A, B, MCS, seq, N - 1); seq.pop_back(); // printf("#2 "); print(seq); } } bool solve(int start, const vector& A, const vector& B, vector& MCS) { vector seq; for (int i = 1; i <= (A.size() - start); i++) { find_CS(start, A, B, MCS, seq, i); } if (MCS.size() == 0) return false; return true; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector> index (101, vector()); int N; cin >> N; vector A (N); for (int i = 0; i < N; i++) { int t; cin >> t; A[i] = t; index[t].push_back(i); } int M; cin >> M; vector B (M); for (int i = 0; i < M; i++) { int t; cin >> t; B[i] = t; } vector max_commonSequence; for (int i = 100; i >= 1; i--) { for (int j = 0; j < index[i].size(); j++) { if (solve(index[i][j], A, B, max_commonSequence)) { cout << max_commonSequence.size() << endl; print(max_commonSequence); return 0; } } } cout << 0 << endl; return 0; }

제출 #17773

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: