# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420618 | Nicholas_Patrick | Cigle (COI21_cigle) | C++17 | 5 ms | 1228 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.
#pragma GCC optimize("O3")
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> d(n);
for(int& i : d)
scanf("%d", &i);
vector<vector<int>> dp(n, vector<int>(n, 0));
/*
dp[x][y]
x: last brick laid
y: earliest brick in last row
y≤x
*/
for(int i=1; i<n; i++){
vector<int> suffsum, prefsum;
for(int j=i; j--;){
if(suffsum.empty()){
suffsum.push_back(d[j]);
}else{
suffsum.push_back(d[j]+suffsum.back());
}
}
for(int j=i; j<n; j++){
if(prefsum.empty()){
prefsum.push_back(d[j]);
}else{
prefsum.push_back(d[j]+prefsum.back());
}
}
for(int j=0, k=0, matches=0; j<prefsum.size(); j++){
while(k+1<suffsum.size() and suffsum[k]<prefsum[j])
k++;
if(prefsum[j]==suffsum[k]){
matches++;
if(i+j+1<n)
dp[i+j+1][i]=max(dp[i+j+1][i], dp[i-1][i-k-2]+matches);
}
}
if(i){
for(int j=0; j<n; j++)
dp[j][i-1]=max(dp[j][i-1], dp[j][i]);
}
for(int j=1; j<n; j++)
dp[j][i]=max(dp[j][i], dp[j-1][i]);
}
printf("%d\n", dp[n-1][n-1]);
}
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... |