Submission #205233

#	Time	Username	Problem	Language	Result	Execution time	Memory
205233		theStaticMind	Candies (JOI18_candies)	C++14	8 / 100	613 ms	524292 KiB

candies

#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int32_t main(){
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);

      int n;
      cin >> n;
      vector<vector<vector<int> > > dp(n + 1, vector<vector<int> > (n + 1, vector<int>(2, -INF)));
      for(int i = 0;i <= n; i++){
            dp[i][0][0] = 0;
      }
      vector<int> arr(n + 1, 0);
      for(int i = 1; i <= n; i++)cin >> arr[i];

      for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; 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] + arr[i];
            }
      }
      for(int i = 1; i <= (n + 1) / 2; i++)cout << max(dp[n][i][0], dp[n][i][1]) << "\n";
}

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