제출 #1035078

#제출 시각아이디문제언어결과실행 시간메모리
1035078May27_thFinancial Report (JOI21_financial)C++17
0 / 100
4051 ms7000 KiB
#include<bits/stdc++.h> using namespace std; #define i64 long long #define mp make_pair #define pb push_back #define all(x) (x).begin(), (x).end() const int INF = 1e9; void Maximize(pair<int, int> &a, pair<int, int> b) { if (a.first < b.first) a = b; else if (a.first == b.first) a.second = min(a.second, b.second); } void Solve(void) { int N, D; cin >> N >> D; vector<int> a(N + 1); vector<pair<int, int>> f(N + 1); for (int i = 1; i <= N; i ++) cin >> a[i]; int ans = 1; for (int st = 1; st <= N; st ++) { f[st] = mp(1, a[st]); for (int i = st + 1; i <= N; i ++) { f[i] = mp(-INF, INF); for (int j = i - 1; j >= max(st, i - D); j --) { if (f[j].first == -INF || a[i] < f[j].second) continue; pair<int, int> cur = mp(f[j].first + (a[i] > f[j].second), max(a[i], f[j].second)); Maximize(f[i], cur); } // cout << i << " " << f[i].first << " " << f[i].second << "\n"; ans = max(ans, f[i].first); } // cout << st << " " << ans << "\n"; } cout << ans << "\n"; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); int Tests = 1; // cin >> Tests; while (Tests --) { Solve(); } }
#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...