Submission #1072232

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072232		vjudge1	송신탑 (IOI22_towers)	C++17	11 / 100	10 ms	3028 KiB

towers

#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;

ll n, k;
vll ve;
void init (int n, vi ve) {
    ::n = n;
    k = 0;
    ::ve = vll(ve.begin(), ve.end());
    while (ve[k] < ve[k+1]) k++;
}

const ll MAXN = 2E3+16;
ll dp[MAXN];
int max_towers (int ql, int qr, int d) {
    fill(dp+ql, dp+qr+1, 0);
    for (ll i = ql; i <= qr; i++) {
        ll maxN = 0;
        dp[i] = 1;
        for (ll j = i-1; j >= ql; j--) {
            if (max(ve[i], ve[j]) <= maxN-d) dp[i] = max(dp[i], dp[j]+1);
            maxN = max(maxN, ve[j]);
        }
    }
    return *max_element(dp+ql, dp+qr+1);
}

• Subtask 1: 0 / 4
• Subtask 2: 11 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23