# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39885 | ddokddogi | Bali Sculptures (APIO15_sculpture) | C++14 | 0 ms | 2116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long lld;
lld dp[110][110], n, a, b, num[110], dap=LONG_LONG_MAX, sum[110];
int main(){
//freopen("input.txt", "r", stdin);
lld i, j, k;
scanf("%lld%lld%lld",&n,&a,&b);
for(i=1;i<=n;i++){scanf("%lld", &num[i]);sum[i]=sum[i-1]+num[i];}
for(i=1;i<=n;i++)for(j=1;j<=n;j++)dp[i][j]=LONG_LONG_MAX;
for(i=1;i<=n;i++)dp[1][i]=sum[i];
for(i=2;i<=n;i++){
for(j=i;j<=n;j++){
for(k=i-1;k<j;k++){
dp[i][j] = min(dp[i][j], dp[i-1][k]|(sum[j]-sum[k]));
}
}
}
for(i=a;i<=b;i++) dap = min(dap, dp[i][n]);
printf("%lld", dap);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |