| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1237603 | clemmy14 | Bouquet (EGOI24_bouquet) | C++20 | 39 ms | 2756 KiB |
#include<bits/stdc++.h>
using namespace std;
signed main() {
int n; cin >> n;
vector<int> l(n), r(n);
for(int i=0; i<n; i++) cin >> l[i] >> r[i];
vector<int> dp(n, 1);
for(int i=0; i<n; i++) {
for(int j=i-1; j>=max(0, i-6); j--) {
if(j+r[j] < i && j < i-l[i]) dp[i]=max(dp[i], dp[j]+1);
}
}
int ans=0;
for(int i=0; i<n; i++) ans=max(ans, dp[i]);
cout << ans;
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... | ||||
