Submission #60968756

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define TxtIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); freopen("error.txt","w", stderr) ;
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int f(vector<int> &v){
    int n=v.size();
    vector<map<int, int>> dp(n);
    int y=1;
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            int u=1;
            if(dp[j].find(v[i]-v[j])!=dp[j].end()){
                u=dp[j][v[i]-v[j]];
            }
            int p=1+u;
            dp[i][v[i]-v[j]]=p;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define TxtIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); freopen("error.txt","w", stderr) ;
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define oset tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

int f(vector<int> &v){
    int n=v.size();
    vector<map<int, int>> dp(n);
    int y=1;
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            int u=1;
            if(dp[j].find(v[i]-v[j])!=dp[j].end()){
                u=dp[j][v[i]-v[j]];
            }
            int p=1+u;
            dp[i][v[i]-v[j]]=p;
            y=max(y,p);
        }
    }
    return y;   
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    vector<int> a[3001];
    int n;cin>>n;
    for(int i=0;i<n;i++){
        int x;cin>>x;
        a[x].push_back(i);
    }
    int r=1;
    for(int i=0;i<=3000;i++){
        if(a[i].size()==0){
            continue;
        }
        r=max(r,f(a[i]));
    }
    cout<<r<<endl;
    return 0;
}

Submission Info

Judge Result