# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440769 | training4usaco | Longest beautiful sequence (IZhO17_subsequence) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
int a[n+1], k[n+1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> k[i];
}
int popCnt[1024];
for (int i = 0; i < 1024; i++) {
popCnt[i] = __builtin_popcount(i);
}
static int dp[1024][1024][11];
memset(dp, 0, sizeof(dp));
//at index i what is the longest chain you can form
int best[n+1];
fill(best, best+n+1, 0);
//at index i what is the first element in the longest
//chain you can form so far
int store[n+1];