| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1358703 | lyra_g13 | 송신탑 (IOI22_towers) | C++20 | 4083 ms | 1588 KiB |
#include "towers.h"
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int n;
vector<int> h;
void init(int N, vector<int> H) {
n = N;
h = H;
};
int max_towers(int l, int r, int d) {
int ans = 1;
vector<int> dp(n, 1);
for (int i = l; i <= r; i++) {
dp[i] = 1;
int mid = 0;
for (int j = i - 1; j >= l; j--) {
if (j + 1 < i)
mid = max(mid, h[j + 1]);
int bound = max(h[j], h[i]) + d;
if (mid >= bound)
dp[i] = max(dp[i], dp[j] + 1);
}
ans = max(ans, dp[i]);
}
return ans;
};| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
