Submission #869334

#	Time	Username	Problem	Language	Result	Execution time	Memory
869334		prohacker	Split the sequence (APIO14_sequence)	C++14	50 / 100	125 ms	5468 KiB

sequence

#include <bits/stdc++.h>
#define ll long long
#define ld long double
 
using namespace std;
 
const int N = 1010;
const int INF = INT_MAX;
const int mod = 1e9+7;
 
int n,m;
ll dp[N][210],ans;
int s[N],trace[N][210];
stack<int> st;
int pointer;
vector<ll> M;
vector<ll> B;
vector<int> idx;
 
bool bad(int l1,int l2,int l3) {
    return (long double)(B[l3]-B[l1])/(B[l2]-B[l1])<(long double)(M[l1]-M[l3])/(M[l1]-M[l2]);
}
 
void add(long long m,long long b, int id) {
    M.push_back(m);
    B.push_back(b);
    idx.push_back(id);
    while (M.size()>=3&&bad(M.size()-3,M.size()-2,M.size()-1))
    {
        M.erase(M.end()-2);
        B.erase(B.end()-2);
        idx.erase(idx.end()-2);
    }
}
 
pair<ll,int> query(ll x) {
    if (pointer>=M.size()) pointer=M.size()-1;
    while (pointer<M.size()-1&&M[pointer+1]*x+B[pointer+1]<M[pointer]*x+B[pointer]) pointer++;
    return {M[pointer]*x+B[pointer],idx[pointer]};
}
 
signed main()
{
    if (fopen("task.inp", "r")) {
        freopen("task.inp", "r", stdin);
        freopen("task.out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for(int i = 1 ; i <= n ; i++) {
        int x; cin >> x;
        s[i] = s[i-1] + x;
    }
    for(int i = 1 ; i <= n ; i++) {
        for(int k = 1 ; k <= m ; k++) {
//            add(s[i-1],dp[i-1][k-1]-1LL*s[i-1]*s[n],i-1);
//            pair<ll,int> val = query(s[i]);
//            dp[i][k] = val.first+1LL*s[i]*(s[n]-s[i]);
//            trace[i][k] = val.second;
            for(int j = i-1 ; j >= 0 ; j--) {
                if(dp[j][k-1]+1LL*(s[i]-s[j])*(s[n]-s[i]) > dp[i][k]) {
                    dp[i][k] = dp[j][k-1]+1LL*(s[i]-s[j])*(s[n]-s[i]);
                    trace[i][k] = j;
                }
            }
        }
//        B.clear();
//        M.clear();
//        idx.clear();
    }
    int id;
    ans = -1;
    for(int i = 1 ; i <= n ; i++) {
        if(dp[i][m] > ans) {
            ans = dp[i][m];
            id = i;
        }
    }
    cout << ans << '\n';
    while(m > 0) {
        cout << id << " ";
        id = trace[id][m];
        m--;
    }
    return 0;
}

Compilation message (stderr)

sequence.cpp: In function 'std::pair<long long int, int> query(long long int)':
sequence.cpp:37:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     if (pointer>=M.size()) pointer=M.size()-1;
      |         ~~~~~~~^~~~~~~~~~
sequence.cpp:38:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     while (pointer<M.size()-1&&M[pointer+1]*x+B[pointer+1]<M[pointer]*x+B[pointer]) pointer++;
      |            ~~~~~~~^~~~~~~~~~~
sequence.cpp: In function 'int main()':
sequence.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         freopen("task.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:46:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |         freopen("task.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:84:12: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
   84 |         id = trace[id][m];
      |         ~~~^~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 17 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29