ICPCCamp 2016 Day 3 - F Similar Subsequence (dp)

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;


#define N 520
#define inf 0x3f3f3f3f

int n, m, a[N], b[N];
int dp[N][N];



int main() {
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
	}
	for(int i = 1; i <= m; ++i) scanf("%d", &b[i]);
	for(int i = 1; i <= n; ++i) {
		if(a[i] > a[n]) a[i] = 1;
		else a[i] = 0;
	}
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= m; ++j) {
			if(a[i] == 1) dp[i][j] = inf;
			else dp[i][j] = 0;
			if(i == 1) {
				if(a[i] == 1) dp[i][j] = 0;
				else dp[i][j] = inf;
				continue;
			}
			if(a[i] == 1) {
				if(a[i-1] == 1) {
					for(int u = 1; u < j; ++u) {
						if(b[u] > b[j] && dp[i-1][u] < b[j]) {
							dp[i][j] = min(dp[i][j], dp[i-1][u]);
						}
					}
				}
				else {
					for(int u = 1; u < j; ++u) {
						if(dp[i-1][u] > b[j] && b[u] < b[j]) {
							dp[i][j] = min(dp[i][j], b[u]);
						}
					}
				}
			}
			else {
				if(a[i-1] == 0) {
					for(int u = 1; u < j; ++u) {
						if(b[u] < b[j] && dp[i-1][u] > b[j]) {
							dp[i][j] = max(dp[i][j], dp[i-1][u]);
						}
					}
				}
				else {
					for(int u = 1; u < j; ++u) {
						if(dp[i-1][u] < b[j] && b[u] > b[j]) {
							dp[i][j] = max(dp[i][j], b[u]);
						}
					}
				}
			}
		}
	}
	bool f = 0;
	for(int i = 1; i <= m; ++i) if(dp[n][i] != 0) f = 1;
	puts(f? "Yes": "No");
	return 0;
}