| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1359906 | Peti | Global Warming (CEOI18_glo) | C++20 | 2095 ms | 2756 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, d;
cin>>n>>d;
vector<int> v(n);
for(auto &x : v) cin>>x;
vector<array<int, 2>> dp(n);
int ans = 0;
for(int i = 0; i < n; i++) {
dp[i][0] = dp[i][1] = 1;
for(int j = 0; j < i; j++) {
if(v[j] < v[i]) {
dp[i][0] = max(dp[i][0], dp[j][0] + 1);
dp[i][1] = max(dp[i][1], dp[j][1] + 1);
}
if(v[j] < v[i] + d) dp[i][1] = max(dp[i][1], dp[j][0] + 1);
}
ans = max(ans, dp[i][1]);
}
cout << ans << '\n';
return 0;
}| # | 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... | ||||
