제출 #675974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675974		sudheerays123	무제 (POI11_tem)	C++17	0 / 100	229 ms	65536 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 1e6+5 , K = 55 , INF = 1e18 , MOD = 1e9+7 ;

ll dp[N][2*K];
ll n;
vector<pair<ll,ll>> a(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 == K || 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;

	memset(dp,-1,sizeof dp);

	ll ans = -INF;

	for(ll i = 1; i <= n; i++) ans = max(ans,go(i,K));
	cout << ans;
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9