제출 #1235611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1235611		Aisha	Maxcomp (info1cup18_maxcomp)	C++20	0 / 100	0 ms	324 KiB

maxcomp

#include "bits/stdc++.h"

using namespace std;

#define int long long

int sol(vector <int> a) {
    int m = a.size();

    vector <int> p(m + 1);
    vector <int> s(m + 1);
    int ans = -1; 

    p[1] = a[1] + 1;
    s[m] = a[m] + m;
    for (int i = 2; i <= m; i ++) p[i] = max(a[i] + i, p[i - 1]);
    for (int i = m - 1; i >= 1; i --) s[i] = min(s[i + 1], a[i] + i);
    
    for (int i = 1; i <= m; i ++) {
        ans = max(ans, p[i] - s[i] - 1);
    }

    return ans;
}

signed main() {
    int n, m;
    cin >> n >> m;

    vector <int> a(m + 1);
    for (int i = 1; i <= m; i ++) cin >> a[i];

    int ans = sol(a);
    reverse(a.begin(), a.end());
    for (int i = m; i >= 1; i --) a[i] = a[i - 1];
    ans = max(ans, sol(a));

    cout << ans << endl;

    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40