oj.uz

답안 #96721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96721 2019-02-11T14:45:04 Z Retro3014 Candies (JOI18_candies) C++17
0 / 100
 21 ms 24056 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>


using namespace std;
#define MAX_N 2000
#define INF 1000000000000000000LL
typedef long long ll;

int N;
vector<ll> v;
ll dp[MAX_N+10][MAX_N+10];

int main(){
	scanf("%d", &N);
	for(int i=0; i<N; i++){
		ll x;
		scanf("%lld", &x); v.push_back(x);
	}
	for(int i=0; i<N; i++){
		for(int j=1; j<=((N+1)/2); j++){
			dp[i][j] = -INF;
		}
	}
	for(int i=0; i<N; i++){
		for(int j=1; j<=((i+2)/2); j++){
			if(i<=1){
				dp[i][j] = v[i];
			}else{
				dp[i][j] = max(dp[i-1][j], dp[i-2][j-1]+v[i]);
			}
		}
	}
	for(int i=1; i<=(N+1)/2; i++){
		printf("%lld\n", dp[N-1][i]);
	}
	return 0;
}

Compilation message

candies.cpp: In function 'int main()':
candies.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
candies.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &x); v.push_back(x);
   ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 24056 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 24056 KB Output isn't correct
2 Halted 0 ms 0 KB -