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>
#define maxn 2005
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define inf 1e15
using namespace std;
typedef long long ll;
ll niz[maxn];
ll dp[maxn][maxn];
int n;
ll pref[maxn];
ll a,b;
int main()
{
ios_base::sync_with_stdio(false);
cin >> n >> a >> b;
for(int i=1; i<=n; i++)cin >> niz[i];
pref[0] = 0;
for(int i=1; i<=n; i++)pref[i] = pref[i - 1] + niz[i];
if(1){
for(int i=1;i <=n; i++){
dp[0][i] = inf;
}
for(int i=1; i<=n; i++){
dp[i][0] = inf;
}
dp[0][0] = 0;
for(int i=1; i<=n; i++){
for(int j=1; j<=b; j++){
dp[i][j] = inf;
if(j > i)continue;
for(int k=0; k<=i - 1; k++){
dp[i][j] = min(dp[k][j - 1] | (pref[i] - pref[k]), dp[i][j]);
}
}
}
ll mini = dp[n][a];
for(int i=a; i<=b; i++)mini = min(mini, dp[n][i]);
cout << mini << endl;
return 0;
}
return 0;
}
# | 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... |