Submission #798828

#	Time	Username	Problem	Language	Result	Execution time	Memory
798828		vjudge1	Candies (JOI18_candies)	C++14	8 / 100	685 ms	24156 KiB

candies

#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const ll N = 1e5, NS = 2e3 ;
ll n, a[N + 1], ans[NS + 1], dp[NS + 1][NS + 1][2] ;
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n ;
    for(ll i = 1 ; i <= n ; i++)
        cin >> a[i] ;
    if(n <= 2000)
    {
        for(ll i = 1 ; i <= n ; i++)
            for(ll j = 1 ; j <= (i + 1) / 2 ; j++)
            {
                dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j][1]) ;
                dp[i][j][1] = dp[i - 1][j - 1][0] + a[i] ;
                ans[j] = max({ans[j], dp[i][j][0], dp[i][j][1]}) ;
            }
//        for(ll i = 1 ; i <= n ; i++)
//            for(ll j = 1 ; j <= i ; j++)
//                cout<<i<<' '<<j<<' '<<dp[i][j][0] << ' ' << dp[i][j][1] << '\n' ;
        for(int i = 1 ; i <= (n + 1) / 2 ; i++)
            cout << ans[i] << '\n' ;
        return 0 ;
    }
    return 0 ;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 92