Submission #499976

#	Time	Username	Problem	Language	Result	Execution time	Memory
499976		Carmel_Ab1	Split the sequence (APIO14_sequence)	C++17	0 / 100	2081 ms	15948 KiB

sequence

/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
void solve() {
    int n,k;
    cin >> n >> k;
    vl a(n+1);
    for(int i=1; i<=n; i++)
        cin >> a[i];

    vl pref(n+1);
    for(int i=0; i<=n; i++)
        pref[i]=(i?pref[i-1]:0)+a[i];

    auto sum=[&](int l,int r){return pref[r]-(l?pref[l-1]:0);};

    vvl dp(n+1,vl(k+1)),prv(n+1,vl(k+1,1));



    for(int i=1; i<=n; i++)
        for(int j=1; j<=k; j++) {
            for (int p = 1; p < i; p++) {
                ll val = sum(p+1, i) * sum(1, p ) + dp[p][j-1];
                if (val > dp[i][j])
                    dp[i][j] = val, prv[i][j] = p;//split after p
            }
            if(dp[i][j]<dp[i][j-1])
                dp[i][j] = dp[i][j - 1], prv[i][j] = prv[i][j - 1];
        }
    cout << dp[n][k] << "\n";
    int i=n,j=k;
    vi ans;

    while(i && j){
        ans.pb(prv[i][j]);
        i=prv[i-1][j-1];
        j--;
    }
    
    sort(all(ans));
    for(int i=1; i<ans.size(); i++)
        ans[i]++;
    print(ans)

}
/*
 7 3
4 1 3 4 0 2 3
 */

Compilation message (stderr)

sequence.cpp: In function 'void solve()':
sequence.cpp:113:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for(int i=1; i<ans.size(); i++)
      |                  ~^~~~~~~~~~~
sequence.cpp: In function 'void usaco(std::string)':
sequence.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

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