제출 #107268

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107268		abil	Split the sequence (APIO14_sequence)	C++14	49 / 100	678 ms	132096 KiB

sequence

#include <bits/stdc++.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define int long long

using namespace std;

const int inf = (int)1e9 + 7  ;
const long long mod = 1e9 + 7;
const int N = (int)100007;

int n, k, par[207][N],dp[3][N],arr[N];
int f(int l,int r){
      return arr[l] * (arr[r] - arr[l]);
}
void solve(int g,int l,int r,int optl,int optr){
      if(l > r){
            return;
      }
      int mid = (l + r) >> 1, opt;
      for(int i = optl; i <= min(optr,mid); i++){
            if(dp[(g % 2)][mid] <= dp[(g - 1) % 2][i] + f(i,mid)){
                  dp[(g % 2)][mid] = dp[(g - 1) % 2][i] + f(i,mid);
                  opt = i;
            }
      }
      par[g][mid] = opt;
      solve(g,l,mid - 1, optl, opt);
      solve(g,mid + 1, r, opt, optr);
}
main(){
      cin >> n >> k;
      for(int i = 1;i <= n; i++){
            cin >> arr[i];
            arr[i] = arr[i - 1] + arr[i];
      }
      for(int i = 1;i <= k; i++){
            solve(i,1,n,1,n);
      }
      cout << dp[k % 2][n] << '\n';
      vector<int > ans;
      while(par[k][n]){
            ans.pb(par[k][n]);
            n = par[k][n];
            k--;
      }
      for(int i = ans.size() - 1; i >= 0; i--){
            cout << ans[i] << " ";
      }
}
/*
7 3
4 1 3 4 0 2 3
*/

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp:36:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
sequence.cpp: In function 'void solve(long long int, long long int, long long int, long long int, long long int)':
sequence.cpp:33:12: warning: 'opt' may be used uninitialized in this function [-Wmaybe-uninitialized]
       solve(g,l,mid - 1, optl, opt);
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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