제출 #721706

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

sculpture

#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
//const int mod = 1000000007;







//Note to self: Check for overflow

li a[2006];
li pre[2006];

li profit(int l, int r)
{
    return (pre[r]-pre[l-1])&(pre[l-1]);
}

/*li dp[2006];
int uzo[2006];

int aliens(int n, li lambda)
{
    fff(i,0,n) dp[i]=0,uzo[i]=1;
    fff(i,1,n)
    {
        fff(j,2,i) if (dp[j-1]+profit(j,i)-lambda>dp[i])
        {
            dp[i]=dp[j-1]+profit(j,i)-lambda;
            uzo[i]=uzo[j-1]+1;
        }
    }

    return uzo[n];
}*/

li dp[103][103];

int main()
{
    FAST;

    int n,A,B; cin>>n>>A>>B;
    fff(i,1,n) cin>>a[i];
    fff(i,1,n) pre[i]=pre[i-1]+a[i];

    /*li l=-1,r=1e15;
    while (r-l>1)
    {
        li lambda=l+(r-l)/2;
        if (aliens(n,lambda)<=k) r=lambda;
        else l=lambda;
    }

    int m=aliens(n,r);
    li ojuz=dp[n]+k*r;
    li sum=pre[n];

    cout<<sum-ojuz<<"\n";*/



    if (n>100) return cout<<0,0;

    fff(i,1,n) dp[1][i]=0;
    fff(m,2,B) fff(i,1,n) fff(j,2,i) dp[m][i]=max(dp[m][i],dp[m-1][j-1]+profit(j,i));

    li ans=0;
    fff(m,A,B) ans=max(ans,dp[m][n]);
    cout<<pre[n]-ans<<"\n";
}

//Note to self: Check for overflow

/*

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