제출 #675980

#제출 시각아이디문제언어결과실행 시간메모리
675980sudheerays123무제 (POI11_tem)C++17
0 / 100
55 ms44116 KiB
#include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define ll int const ll N = 1e5+5 , K = 110 , INF = 1e9 , MOD = 1e9+7 ; ll dp[N][K]; vector<pair<ll,ll>> a(N); ll n; ll go(ll i , ll preval){ if(i == n+1) return 0; if(dp[i][preval] != -1) return dp[i][preval]; ll ans = 0; for(ll val = a[i].first; val <= a[i].second; val++) if(preval == 0 || val >= preval) ans = max(ans,1+go(i+1,val)); return dp[i][preval] = ans; } void solve(){ cin >> n; for(ll i = 1; i <= n; i++){ cin >> a[i].first >> a[i].second; a[i].first += 55; a[i].second += 55; } memset(dp,-1,sizeof dp); ll ans = 1; for(ll i = 1; i <= n; i++) ans = max(ans,go(i,0)); cout << ans; } int main(){ fast; ll tc = 1; // cin >> tc; while(tc--) solve(); 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...
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...