Submission #938883

#	Time	Username	Problem	Language	Result	Execution time	Memory
938883		AliHasanli	Candies (JOI18_candies)	C++17	8 / 100	334 ms	524288 KiB

candies

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    long long a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    long long dp[(n+n%2)/2][n];
    dp[0][0]=a[0];
    for(int i=2;i<n;i+=2)
        dp[i/2][i]=a[i]+dp[i/2-1][i-2];
    for(int i=1;i<n;i++)
        dp[0][i]=max(a[i],dp[0][i-1]);
    for(int i=1;i<(n+n%2)/2;i++)
        for(int j=2*i+1;j<n;j++)
            dp[i][j]=max(dp[i][j-1],a[j]+dp[i-1][j-2]);
    for(int i=0;i<(n+n%2)/2;i++)
    cout<<dp[i][n-1]<<endl;
	return 0;
}

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