Submission #1225447

#TimeUsernameProblemLanguageResultExecution timeMemory
1225447julianFinancial Report (JOI21_financial)C++20
0 / 100
4094 ms4936 KiB
#include <iostream> #include <vector> #include <algorithm> #include <utility> #include <numeric> #include <climits> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll n, d; cin >> n >> d; vector<ll> a(n); for (ll& i : a) { cin >> i; } vector<ll> dp(n, 1); for (ll i = 1; i < n; i++) { ll ymax = LLONG_MIN; for (ll j = i - 1; j >= max(0ll, i - d); j--) { if (true || a[j] > ymax) { ymax = a[j]; dp[i] = max(dp[i], dp[j] + (a[i] > a[j])); } } } cout << *max_element(dp.begin(), dp.end()) << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...