51nod 1055最长等差数列

我太菜了，没想到这个题怎么做

给出大神的链接

链接：https://blog.csdn.net/liuyanfeier/article/details/50760657

思路：dp[i][j]表示以i,j为开头的等差数列，从后向前扫描 当a[i]+a[k]==2*a[j]时，dp[i][j] = dp[j][k]+1。

 

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<map>

#define ll long long

using namespace std;

int inf = 0x3f3f3f3f;
const int maxn = 10010;
const int mod=1e9+7;
int a[maxn];
short int dp[maxn][maxn];

int main()
{
    short int ans = 2;
    int n;
    scanf("%d",&n);
    for(int i = 0;i<n;i++)
        scanf("%d",&a[i]);
    sort(a,a+n);
    for(int i = 0;i<n;i++)
        for(int j = i+1;j<n;j++)
            dp[i][j] = 2;
    for(int j = n-1;j>=0;j--)
    {
        int i = j-1;
        int k = j+1;
        while(i>=0&&k<=n-1)
        {
            if(2*a[j]>a[i]+a[k])
                k++;
            else if(2*a[j]<a[i]+a[k])
                i--;
            else
            {
                dp[i][j] = dp[j][k]+1;
                ans = max(ans,dp[i][j]);
                i--;
                k++;
            }
        }
    }
    printf("%d\n",ans);
}