hdu 1423 greatest common increasing subsequence

/*Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 744 Accepted Submission(s): 232Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence. Input Each sequence is described with M - its length (1 <= M <= 500) and M integer numbers Ai (-2^31 <= Ai < 2^31) - the sequence itself. Output output print L - the length of the greatest common increasing subsequence of both sequences. Sample Input 1 5 1 4 2 5 -12 4 -12 1 2 4 Sample Output 2 Source ACM暑期集训队练习赛（二） Recommend lcy*/#include <cstdio>#include <cstdlib>#include <cassert>#include <algorithm>#include <list>using std::list;#define MAX_ARR_SZ 500#define HASH_TAB_BIT_SZ 10#define HASH_TAB_SZ (1 << (HASH_TAB_BIT_SZ))int len_a, len_b;int arr_a[MAX_ARR_SZ];int arr_b[MAX_ARR_SZ];class hash_table_t{ struct elem_t { int a, b, c; int val; elem_t(int _a, int _b, int _c, int _val) : a(_a), b(_b), c(_c), val(_val) {} }; list<elem_t> *entry[HASH_TAB_SZ];public : hash_table_t() { std::fill(entry, entry + HASH_TAB_SZ, (list<elem_t> *)NULL); } ~hash_table_t() { for(int i=0; i<HASH_TAB_SZ; ++i) delete entry[i]; } static int hash(int a, int b, int c) { assert((1 << (HASH_TAB_BIT_SZ)) == (HASH_TAB_SZ)); int t = a ^ b ^ c ^ (a << ((HASH_TAB_BIT_SZ) / 2)) ^ (b << ((HASH_TAB_BIT_SZ) / 2)) ^ (c << ((HASH_TAB_BIT_SZ) / 2)); return (t ^ (t << 1)) & ((HASH_TAB_SZ) - 1); } void insert(int a, int b, int c, int val) { assert(val != -1);#ifndef ONLINE_JUDGE fprintf(stderr, "hash_table_t::insert(a = %d, b = %d, c = %d, val = %d)/n", a, b, c, val);#endif int h = hash(a, b, c); if(entry[h] == NULL) entry[h] = new list<elem_t>; entry[h]->push_back(elem_t(a, b, c, val)); } int get_val(int a, int b, int c) {#ifndef ONLINE_JUDGE fprintf(stderr, "hash_table_t::get_val(a = %d, b = %d, c = %d)/n", a, b, c);#endif int h = hash(a, b, c); if(entry[h] == NULL) {#ifndef ONLINE_JUDGE fprintf(stderr, "return -1; line = %d/n", __LINE__);#endif return -1; } list<elem_t>::iterator it = entry[h]->begin(); while(it != entry[h]->end()) { if(it->a == a && it->b == b && it->c == c) {#ifndef ONLINE_JUDGE fprintf(stderr, "return %d; line = %d/n", it->val, __LINE__);#endif return it->val; } ++it; }#ifndef ONLINE_JUDGE fprintf(stderr, "return -1; line = %d/n", __LINE__);#endif return -1; }}*ht;int gcis(int ind_a, int ind_b, int min, bool is_end){if(is_end)assert(min == 0);#ifndef ONLINE_JUDGE fprintf(stderr, "gcis(ind_a = %d, ind_b = %d, min = %d, is_end = %d)/n", ind_a, ind_b, min, is_end);#endif assert(ht != NULL); int ret = ht->get_val(ind_a, ind_b, min); if(ret != -1) return ret; if(ind_a < 0 || ind_b < 0) return 0; int tmp = std::max( gcis(ind_a - 1, ind_b, min, is_end), gcis(ind_a, ind_b - 1, min, is_end)); int tmp0 = 0; if(arr_a[ind_a] == arr_b[ind_b] && (is_end || arr_a[ind_a] < min)) tmp0 = gcis(ind_a - 1, ind_b - 1, arr_a[ind_a], false) + 1; ht->insert(ind_a, ind_b, min, ret = std::max(tmp, tmp0)); return ret;}int main(){ int cs; scanf("%d", &cs); for(int k=0; k<cs; ++k) { ht = new hash_table_t; scanf("%d", &len_a); for(int i=0; i<len_a; ++i) scanf("%d", &arr_a[i]); scanf("%d", &len_b); for(int i=0; i<len_b; ++i) scanf("%d", &arr_b[i]);if(k != 0)printf("/n"); printf("%d/n", gcis(len_a - 1, len_b -1, 0, true)); delete ht; } return 0;}