oj.uz

답안 #236703

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236703 2020-06-03T04:25:08 Z LittleFlowers__ Candies (JOI18_candies) C++17
0 / 100
 23 ms 32000 KB 
#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

const int N=2010;

int n;
int a[N];
int f[N][N],g[N][N];

main(){
    #define task "3"
    //freopen(task".inp","r",stdin);

    n=in;
    forinc(i,1,n) a[i]=in;

    reset(f,-127), reset(g,-127);

    forinc(i,0,n) g[i][0]=0;


    forinc(i,1,n){
        forinc(j,1,(n+1)/2){
            g[i][j]=max(g[i-1][j],f[i-1][j]);
            f[i][j]=g[i-1][j-1]+a[i];
        }
    }
    forinc(i,1,(n+1)/2)
        cout<<max(f[n][i],g[n][i])<<"\n";
}

Compilation message

candies.cpp:28:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 92.0

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