제출 #764104

#제출 시각아이디문제언어결과실행 시간메모리
764104dxz05송신탑 (IOI22_towers)C++17
11 / 100
4066 ms1488 KiB
#pragma GCC optimize("Ofast,O3,unroll-loops") #pragma GCC target("avx,avx2") #include "towers.h" #include <bits/stdc++.h> using namespace std; vector<int> a; void init(int N, vector<int> H) { a = H; } int max_towers(int L, int R, int D) { vector<int> dp(R + 1, 1); for (int i = L; i < R; i++){ int mx = a[i + 1]; for (int j = i + 2; j <= R; j++){ if (a[i] <= mx - D && a[j] <= mx - D && dp[j] < dp[i] + 1) dp[j] = dp[i] + 1; if (mx < a[j]) mx = a[j]; } } return *max_element(dp.begin() + L, dp.begin() + R + 1); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...