bzoj3357 [Usaco2004]等差数列

题目

神奇dp，但是dp数组要用map存一下，好慢呀。。

#include<bits/stdc++.h>
#define N 2000 
using namespace std;
int n,A[N+5],ans;
map <int,int> f[N+5];
inline char nc()
{
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    int x=0,b=1;
    char c=nc();
    for(;!(c<='9'&&c>='0');c=nc())if(c=='-')b=-1;
    for(;c<='9'&&c>='0';c=nc())x=x*10+c-'0';
    return x*b;
}
inline void write(int x)
{
    if(x==0)putchar('0');
    else
    {
        char buf[15];
        int len=0;
        if(x<0)putchar('-'),x=-x;
        while(x)buf[++len]=x%10+'0',x/=10;
        for(int i=len;i>=1;i--)putchar(buf[i]);
    }
    putchar(' ');
}
int main()
{
    freopen("in.txt","r",stdin);
    n=read();
    for(int i=1;i<=n;i++)A[i]=read();
    if(n==1)return cout<<1,0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<i;j++)
        {
            f[i][A[j]]=max(f[i][A[j]],2);
            f[i][A[j]]=max(f[i][A[j]],f[j][A[j]*2-A[i]]+1);
            ans=max(ans,f[i][A[j]]);
        }
    cout<<ans;
    return 0;
}