제출 #1325413

#제출 시각아이디문제언어결과실행 시간메모리
1325413djsksbrbfBouquet (EGOI24_bouquet)C++20
28 / 100
3094 ms6620 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
#define fi first
#define se second
#define pb push_back
const int MOD = 1e9 + 7;
const int MAX = 5e5 + 5;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};
#define int ll

signed main(){
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   
   int n; cin >> n;
   int l[n + 5], r[n + 5];
   for(int i = 1 ; i <= n ; i++)cin >> l[i] >> r[i];
   int dp[n + 5];dp[0] = 0;
   int pref[n + 5];pref[0] = 0;
   
   for(int i = 1 ; i <= n ; i++){
      dp[i] = 1;
      for(int j = 1 ; j < i ; j++){
         if(j + r[j] < i && j < i - l[i])dp[i] = max(dp[j] + 1, dp[i]);
      }
   }
   
   int ans = 0;
   for(int i = 1 ; i <= n ; i++)ans = max(ans, dp[i]);
   cout << ans << endl;
   
   return 0;
}
#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...