ADS Homework 7-1 Favorite Color Stripe

这道题实际上是一个LCS问题的变种，首先去掉不喜欢的颜色，然后利用一个二维矩阵来进行迭代（消耗大量内存）。

#include <iostream>
#include <vector>

using namespace std;

vector<int> list[201];
int color_fav[201];
int old[10001];
int result[201][10000];

int FindColor(int color, int column){
	vector<int>& vec = list[color];
	for (int i = 0; i < vec.size(); i++)
		if (vec[i] <= column)
			return vec[i];
	return -1;
}
int main(){
	int colorNum, n;
	int i, j;
	cin >> colorNum >> n;
	for (i = 0; i < n; i++)
		cin >> color_fav[i];
	for (i = n - 1; i >= 0; i--)
		list[color_fav[i]].push_back(i);
	int length;
	cin >> length;
	for (i = 1; i <= length; i++)
		cin >> old[i];

	for (j = 0; j < n; j++)
		result[j][0] = 0;
	for (int temp = 0; temp < length; temp++){
		j = temp + 1;
		int color = old[j];
		for (i = 0; i < n; i++){
			if (FindColor(color, i) == -1)
				result[i][j] = result[i][j - 1];
			else{
				int index = FindColor(color, i);
				if (result[index][j - 1] + 1 > result[i][j - 1])
					result[i][j] = result[index][j - 1] + 1;
				else
					result[i][j] = result[i][j - 1];
			}
		}
	}
	cout << result[n - 1][length];
}

在网上看到过一个比较骚的是用一个一维数组来处理，原理很简单

//a and b are the two array, m and l are the length 
int getLongest(int *a, int *b, int m, int l) {
    int *d = new int[l];
    int len = 0;
    for (int i = 0; i < l; i++) {
        d[i] = 1; 
        for (int j = 0; j < i; j++) {
            if (order[b[j]] <= order[b[i]] && d[i] < d[j] + 1) {
                d[i] = d[j] + 1;
            }
        }
        if (len < d[i]) len = d[i];
    }
    return len;
}