//#if 0
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <math.h>
#include <string>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <time.h>
#include <set>
#include <list>
#include <iostream>
#define ll long long
#define ull unsigned long long
#define cls(x) memset(x,0,sizeof(x))
#define clslow(x) memset(x,-1,sizeof(x))
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=1e5+20;
const int mod=1000000007;
int dp[5001][5001],a[5001],n;
int sear(int x,int l,int r)
{
int mid;
while(l<r){
mid=(l+r)>>1;
if(a[mid]==x)return mid;
if(a[mid]>x)r=mid;
else l=mid+1;
}
if(a[l]!=x)return 0;
return a[l];
}
int main()
{
// freopen("in.txt","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
int tmp,last,ans=0;
dp[2][1]=1;
// cout<<sear(0,1,n)<<endl;
for(int i=2;i<=n;i++){
last=i-1;
for(int j=i-1;j>=1;j--){
tmp=sear(2*a[j]-a[i],1,last);
dp[i][j]=dp[j][tmp]+1;
last= tmp==0 ? last : tmp;
ans= ans>dp[i][j] ? ans : dp[i][j];
// cout<<i<<" "<<j<<endl;
// cout<<1<<" "<<last<<" "<<dp[i][j]<<endl;
// cout<<a[i]<<" "<<a[j]<<" "<<2*a[j]-a[i]<<" "<<tmp<<endl;
}
}
printf("%d\n",ans+1);
return 0;
}
gym102082b DP
最新推荐文章于 2020-04-13 15:02:32 发布