poj 1631 Bridging signals

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>

using namespace std;

#define INF 0x3f3f3f3f

int n;

int a[50500];
int dp[50500];

int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
scanf("%d",&t);

while(t--)
{
memset(a,0,sizeof(a));
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}

fill(dp,dp+n,INF);

for(int i=0;i<n;i++)
{
*lower_bound(dp,dp+n,a[i])=a[i];
}
printf("%d\n",lower_bound(dp,dp+n,INF)-dp);
}
return 0;
}

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>

using namespace std;

#define INF 0x3f3f3f3f

int n;

int a[5050];
int dp[5050];

int main()
{
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
int t;
scanf("%d",&t);

while(t--)
{
memset(a,0,sizeof(a));
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}

memset(dp,0,sizeof(dp));

int res=0;
for(int i=1;i<=n;i++)
{
dp[i]=1;
for(int j=1;j<i;j++)
{
if(a[j]<a[i])
{
dp[i]=max(dp[i],dp[j]+1);
}
}
res=max(dp[i],res);
}
printf("%d\n",res);
}
return 0;
}