제출 #660806

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660806		Niya	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	18 ms	33132 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
const long long maxn = 2048;

long long n,a,b;
long long age[maxn];
long long par[maxn];
long long dp[maxn][maxn];

void read()
{
    cin >> n >> a >> b;
    for( long long i = 1; i <= n; i ++ )
        cin >> age[i];
}

void solve()
{
    memset(dp,-1,sizeof(dp));

    for( long long i = 1; i <= n; i ++ )
        par[i] = par[i-1] + age[i];

    for( long long i = 1; i <= n; i ++ )
        dp[i][1] = par[i];

    for( long long j = 2; j <= b; j ++ )
    {
        for( long long i = j; i <= n; i ++ )
        {
            for( long long k = i; k > j-1; k -- )
            {
                if( dp[k-1][j-1] == -1 ) continue;
                long long x = ( dp[k-1][j-1] | ( par[i] - par[k-1] ) );
                if( dp[i][j] == -1 || x < dp[i][j] ) dp[i][j] = x;
            }
        }
    }

    long long ans = -1;
    for( long long i = a; i <= b; i ++ )
        if( ans == -1 || dp[n][i] < ans ) ans = dp[n][i];

    cout << ans << '\n';
}
int main()
{
    read();
    solve();
    return 0;
}

/*
6 1 3
8 1 2 1 5 4
*/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29