#1183280 (C++23) No.3683 サーバー代がもったいない!

• 問題: No.3683 サーバー代がもったいない!
• ユーザー: hibit_at
• 提出日時: 2026-09-05 13:30:54
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0)
• 結果: AC
• 実行時間: 319 ms / 2,000 ms
• コード長: 4,604 bytes
• コンパイル時間: 1,488 ms
• コンパイル使用メモリ: 224,764 KB
• 実行使用メモリ: 285,440 KB
• 最終ジャッジ日時: 2026-09-05 13:31:17
• 合計ジャッジ時間: 8,888 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge4_1

ファイルパターン	結果
sample	AC * 3
other	AC * 27

ソースコード

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>
#include <array>
#include <cassert>
#include <random>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(A) A.begin(), A.end()
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p)
{
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    os << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}

int main(){
    int n,k;
    cin >> n >> k;
    using VI = vector<ll>;
    using VVI = vector<VI>;
    using VVVI = vector<VVI>;
    using VVVVI = vector<VVVI>;
    using VVVVVI = vector<VVVVI>;
    VVVI dp(n+1,VVI(k+1,VI(2,-1e18)));
    dp[0][0][0] = 0;
    auto chmax = [](auto &a, const auto &b) {
        if(a<b){
            a=b;
            return true;
        }
        return false;
    };
    rep(i,n){
        int a;
        cin >> a;
        rep(now_cnt,k+1){
            rep(now_state,2){
                if(dp[i][now_cnt][now_state]==-1e18){
                    continue;
                }
                chmax(dp[i+1][now_cnt][0],dp[i][now_cnt][now_state]);
                if(now_cnt+1<=k && now_state==0){
                    dp[i+1][now_cnt+1][1] += dp[i][now_cnt][now_state]+a;
                    chmax(dp[i+1][now_cnt+1][1],dp[i][now_cnt][now_state]+a);
                }
            }
        }
    }
    // cout << dp << endl;
    ll ans = *max_element(all(dp[n][k]));
    if(ans>-1e18){
        cout << ans << endl;
    }else{
        cout << "Impossible" << endl;
    }
}