結果

問題 No.2854 -1 Subsequence
ユーザー hibit_athibit_at
提出日時 2024-08-25 14:37:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 149 ms / 2,000 ms
コード長 4,584 bytes
コンパイル時間 1,269 ms
コンパイル使用メモリ 116,084 KB
実行使用メモリ 34,512 KB
最終ジャッジ日時 2024-08-25 14:37:57
合計ジャッジ時間 5,585 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 103 ms
28,604 KB
testcase_01 AC 97 ms
27,272 KB
testcase_02 AC 99 ms
28,488 KB
testcase_03 AC 58 ms
16,768 KB
testcase_04 AC 113 ms
31,404 KB
testcase_05 AC 72 ms
20,864 KB
testcase_06 AC 48 ms
13,056 KB
testcase_07 AC 112 ms
30,396 KB
testcase_08 AC 16 ms
6,944 KB
testcase_09 AC 79 ms
22,656 KB
testcase_10 AC 127 ms
34,436 KB
testcase_11 AC 144 ms
34,452 KB
testcase_12 AC 128 ms
34,480 KB
testcase_13 AC 129 ms
34,484 KB
testcase_14 AC 128 ms
34,408 KB
testcase_15 AC 126 ms
34,472 KB
testcase_16 AC 149 ms
34,440 KB
testcase_17 AC 126 ms
34,492 KB
testcase_18 AC 126 ms
34,428 KB
testcase_19 AC 130 ms
34,412 KB
testcase_20 AC 126 ms
34,420 KB
testcase_21 AC 120 ms
34,456 KB
testcase_22 AC 131 ms
34,512 KB
testcase_23 AC 2 ms
6,944 KB
testcase_24 AC 2 ms
6,944 KB
testcase_25 AC 1 ms
6,944 KB
testcase_26 AC 2 ms
6,944 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 2 ms
6,940 KB
testcase_29 AC 0 ms
6,944 KB
testcase_30 AC 2 ms
6,940 KB
testcase_31 AC 1 ms
6,944 KB
testcase_32 AC 2 ms
6,940 KB
testcase_33 AC 2 ms
6,944 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,944 KB
testcase_36 AC 1 ms
6,940 KB
testcase_37 AC 1 ms
6,940 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#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 << " ";
    }
    cout << 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(){
    ll n;
    cin >> n;
    vector<ll> a(n);
    cin >> a;
    // vector<vector<vector<ll>>> dp(n+1,vector<ll>(2,-1));
    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(2,VI(2,-1e18)));
    dp[0][0][0] = 0;
    auto chmax = [](auto &a, auto b)
    { a = max(a, b); };
    dp[0][0][0] = 0;
    rep(i,n){
        rep(state,2){
            rep(virgin,2){
                if(dp[i][state][virgin] == -1e18){
                    continue;
                }
                chmax(dp[i+1][state][virgin],dp[i][state][virgin]);
                ll next_val = dp[i][state][virgin];
                if(state == 0){
                    next_val -= a[i];
                }else{
                    next_val += a[i];
                }
                chmax(dp[i+1][state^1][virgin|1],next_val);
            }
        }
    }
    cout << max(dp[n][0][1],dp[n][1][1]) << endl;
}
0