HDu 1423最長上昇共通サブシーケンスLCISテンプレート問題

1915 ワード
DP
Greatest Common Increasing Subsequence
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2484    Accepted Submission(s): 762
Problem Description
This 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暑期集训队练习赛（二）
 
http://acm.hdu.edu.cn/showproblem.php?pid=1423
 
  
#include
#include
int a[510],b[510];
int dp[510];
int main()
{
    int t,m,n,i,j;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0;idp[pos])  pos=j;
                if(b[j]==a[i]&&dp[j]
JAva置換wordテンプレートにおけるプレースホルダDocx 4 jとPoi実装
エンジニアと名乗るからには、ブログの自動投稿くらい実装してるよな？　：）