ZOJ 2136 Longest Ordered Subsequence 【DP】

求最大上升子序列

//2630318 2011-08-16 21:41:31 Accepted 2136 C 0 168 ylwh@Unknown#include <stdio.h>#define N 1001int s[N], d[N];int main(){int t, i, j, n, ans;scanf("%d", &t);while(t--){ans = 0;scanf("%d", &n);for(i=0; i<n; i++){scanf("%d", &s[i]);d[i] = 1;for(j=0; j<i; j++)if(s[j] < s[i] && d[j] + 1 > d[i])d[i] = d[j] + 1;if(d[i] > ans)ans = d[i];}printf("%d\n", ans);if(t)printf("\n");}    return 0;}