제출 #1116718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116718		monaxia	수열 (APIO14_sequence)	C++17	0 / 100	333 ms	60192 KiB

sequence

#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fr first
#define sc second
#define all(v) v.begin(), v.end()
#define mod (long long)(1e9 + 7)
#define eps (long long)(1e-9)
#define vektor vector
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;

const ull Mod = 1e9 + 7;

ll pre[100005], dp[205][100005];
int where[205][100005];
int n, k;

ll cost(int l, int r){
    return (pre[r] - pre[l - 1]) * max(1ll, pre[l - 1]);
}

void dp_do(int l, int r, int optl, int optr, int layer){
    if(l > r) return;

    pair <ll, int> best(0, 1);
    int mid = (l + r) >> 1;

    for(int i = optl; i <= min(mid, optr); i ++){
        best = max(best, {dp[layer - 1][i - 1] + cost(i, mid), i});
        cout << cost(i, mid) << "\n";
    }

    // cout << layer << " " << mid << " " << best.fr << " " << best.sc << '\n';

    dp[layer][mid] = best.fr;
    where[layer][mid] = best.sc;
    int opt = best.sc;

    dp_do(l, mid - 1, optl, opt, layer);
    dp_do(mid + 1, r, opt, optr, layer);
}

void solve(){
    cin >> n >> k;

    for(int i = 1; i <= n; i ++){
        ll x;
        cin >> x;
        pre[i] = pre[i - 1] + x;
    }

    for(int i = 1; i <= k; i ++) dp_do(1, n, 1, n, i);

    cout << dp[k][n] << "\n";

    vector <int> ans;

    for(int i = n; k >= 1; k --){
        i = where[k][i] - 1;
        ans.pb(i);
    }

    reverse(all(ans));

    for(auto& x : ans) cout << x << " ";
}
 
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
 
    // if(fopen("blank.inp", "r")){
    //     freopen("blank.inp", "r", stdin);
    //     freopen("blank.out", "w", stdout);
    // }
    
    // // cout << 1; return 0;
 
    ll n = 1;
 
    // cin >> n;

    while(n) {
        solve();
        n --;
        cout << "\n";
    }
 
    // cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}

//                                   ++++                                           
//                          ++++-::......:--:::-=+++                                
//                    ++++=:............---.....--:..:=++++++                       
//                    +++++++::......................::=+++++                       
//             @@               ++++++++++:+++++++++                                
//             @%                                  @*                               
//              %%@@                    *****#*@@                                   
//             %%%%%                  @##**##***%                                   
//           @@@@@@+-*#*@             #####%+*##*@                                  
//                  %#+@%%@@@         ##-%:::-#*###@@                               
//                 =====:*:::        ###-:==::=#*%*                                 
//                    -====:::::+@@%@@%@#*--=*#%%#@%@   @%@                         
//                        @=====%=-@%=:::.:+-::::+::::::::::::%-----%% @@@@@        
//                        @@%#*@++%===+::-================@%@@@@+++++++@@@%%%@#%###%
//               @#***#@@   @##=%@===+--:+==+===+%*##@%%%@@@@@@@@@@:=  @%@%%%@#%%   
//    -@      @*#@         #####%:::-====+:::==---**%#@ *%%%%@@@@@@-:               
//    -=-*%  #          #***--%%::::::::+=-+#-----=**@*#     #+**#@#                
//     ----=----#+****=----=*#@=::::::=#-----------***%*%                           
//      ------------%*****##=@==::::::+%-----------***%**                           
//       +-----------------*@++%::::::::-----------****@*#                          
//         =------------% @%=+%#+:::::::* #-----*--**** **                          
//            ----%--%    *==+++++=+=##*:%   ---=--**** **                          
//                       %@@@@@@@@@==@+%%%%@   ----**** *#                          
//                     @=*+%@@@%@@=++=:%:::%      #***@@#                           
//                    #+++++++++#==++-::::::     @**** *#                           
//                   =+++++++++++==+++:::::::   ####@ #%                            
//                  +++++++++++=@ @++++::::::@      @#                              
//                 @+++++++++=@    =*++=:::::@                                      
//                 ++++++++@       @++++:::::                                       
//                ++++++=           =++++:::                                        
//               =+++++@             =+++::::                                       
//             ++++++-@               =+++:+::                                      
//           @::+::::@                 =++::-:::                                    
//          +::=:::::                  @+*+:-+++-:                                  
//        @::+-:::::#                     +++::::::@                                
//       ::%=:::::::%@                    @%++::::***                               
//     @:+@*:::::::****@                   +@+++:-=*:*@                             
//    *:@@%::::::::=****                   @%@+++:::#**@                            
//   *%@@@-:::::::%=+==*@                   +@%+++:***+*                            
//  #%@@%%::::::::#+=-=#                    =+@+++++:::*+                           
// @####+::::::::%+=@#%#=@                  @**@@%=++::::@                          
// @   +:::::::::***#*@ @@###+=+=%@          +**#+=+*+:::-                          
//    =-:::::::%%%%@@          @#=*########%#+*%%+--@*+::%                          
//   +---%@                                   @@ =-:-**:#                           
//  %%%%%                                        @+--*@                             
// @%%%%@                                        @%%%%%                             
//                                                @%%@@

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