| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229002 | ripolas | Bouquet (EGOI24_bouquet) | C++20 | 3094 ms | 2632 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin>>n;
vector<pair<int,int>> a(n);
vector<int> dp(n,1);
for(int i = 0;i<n;i++){
int l,r;
cin>>l>>r;
a[i] = {l,r};
}
int ans = 0;
for(int i = 0;i<n;i++){
for(int j = 0;j<i;j++){
if(max(a[j].second,a[i].first)<i-j){
dp[i] = max(dp[i],dp[j]+1);
}
}
ans= max(ans,dp[i]);
}
cout<<ans<<endl;
}
/*
4
1 0
1 0
1 0
4 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... | ||||
