제출 #588242

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
588242		stevancv	Global Warming (CEOI18_glo)	C++14	47 / 100	70 ms	5284 KiB

glo

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    auto MakeLIS = [&] (vector<int> v, int f) {
        vector<int> pom(n + 1, 1e9);
        vector<int> ret;
        if (f) for (int i = 0; i < n; i++) v[i] = -v[i];
        for (int i = 0; i < n; i++) {
            int l = 1, r = n;
            int ans = 0;
            while (l <= r) {
                int mid = l + r >> 1;
                if (pom[mid] < v[i]) {
                    l = mid + 1;
                    ans = mid;
                }
                else r = mid - 1;
            }
            ans += 1;
            ret.push_back(ans);
            smin(pom[ans], v[i]);
        }
        return ret;
    };
    vector<int> x = MakeLIS(a, 0);
    reverse(a.begin(), a.end());
    vector<int> y = MakeLIS(a, 1);
    reverse(a.begin(), a.end());
    reverse(y.begin(), y.end());
    int ans = 1;
    vector<int> pom(n + 1, 2e9);
    for (int i = 0; i < n - 1; i++) {
        int l = 1, r = n;
        int w = 0;
        while (l <= r) {
            int mid = l + r >> 1;
            if (pom[mid] - k < a[i]) {
                l = mid + 1;
                w = mid;
            }
            else r = mid - 1;
        }
        smin(pom[x[i]], a[i]);
        smax(ans, w + y[i]);
    }
    cout << ans << en;
    return 0;
}

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

glo.cpp: In lambda function:
glo.cpp:25:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   25 |                 int mid = l + r >> 1;
      |                           ~~^~~
glo.cpp: In function 'int main()':
glo.cpp:49:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |             int mid = l + r >> 1;
      |                       ~~^~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 10 / 10
• Subtask 5: 20 / 20
• Subtask 6: 17 / 17
• Subtask 7: 0 / 25