提出 #60959528

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#include <queue>
#include <sstream>
#include <ctime>
#include <iterator>
#include <string.h>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <fstream>
#include <assert.h>
#include <numeric>
#include <complex>
#include <random>
#include <utility>



#define IOS ios_base::sync_with_stdio(0),cin.tie(0), cout.tie(0);
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,a,b) for(int i = (a) - 1; i>=(b);i--)
#define rep(i,n) FOR(i,0,n)
#define PB push_back
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define VI vector<int>
#define PII pair<int,int>
#define PLL pair<long long,long long>
#define VL vector<long long >
#define FILL(a, value) memset(a, value, sizeof(a))
#define double long double
const int nax = 2 * (int)1e5 + 147;
 
using namespace std;
 
const int MOD = 998244353;
const int INF = 1e9 +47 ;
const long long LINF = (long long)1e18 + 4747;
 
typedef long long LL;
const double EPS = 1e-7;

int dp[3010][3010];
int main() {
    int n;
    cin >> n;
    VI h(n);
    FOR (i, 0, n) {
        cin >> h[i];
    }
    FOR (i, 0, n) {
        dp[0][i] = 1;
    }
    FOR (i, 1, n) {
        FOR (j, 0, n) {
            if(i >= j && h[i] == h[i -j]) {
                dp[i][j] = max(dp[i][j], dp[i - j][j] + 1);
            }
            dp[i][j] = max(1 ,dp[i][j]);
        }
    }
   // cout << dp[1][2] << '\n';
    int ans = 0;
    FOR (i, 0, n) {
        FOR (j, 0, n) {
            ans = max(ans, dp[i][j]);
        }
    }
    cout << ans << '\n';
}
 

提出情報

ジャッジ結果