제출 #92690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
92690		janchomath	Longest beautiful sequence (IZhO17_subsequence)	C++14	0 / 100	4 ms	604 KiB

subsequence

#include<bits/stdc++.h>
#define ll int
#define f first
#define s second
#define pb push_back
using namespace std;
ll n,a[200005],k[200005],dp[5001][5001],ans,ind;
vector<ll>v;
int main(){
	std::ios::sync_with_stdio(false);
	cin >> n;
	
	for(int i=1; i<=n; i++){
		cin >> a[i];
	}
	
	for(int i=1; i<=n; i++){
		cin >> k[i];
	}
	
	for(int i=1; i<=n; i++)dp[i][1] = i;
	ans = 1;
	ind = 1;
	for(int i=1; i<=n; i++){
		ll p = -1;
		for(int j = i-1; j>=1; j--){
			if(__builtin_popcount((a[j]&a[i])) == k[i]){
				p = j;
				break;
			}
		}
		for(int j=2; j<=n; j++){
			if(dp[p][j-1])dp[i][j] = p;
			if(dp[i][j] && j > ans){
				ans = j;
				ind = i;
			}
		}
	}
	
	cout << ans << endl;
	
	while(dp[ind][ans] != ind){
		v.pb(ind);
		ind = dp[ind][ans];
		ans--;
	}
	v.pb(ind);
	
	for(int i=(int)v.size()-1; i>=0; i--){
		cout << v[i] << " ";
	}
	
	
	
	return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 60