제출 #938161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
938161		Whisper	Global Warming (CEOI18_glo)	C++17	27 / 100	68 ms	13244 KiB

glo

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, nRange;
int a[MAX];
//the most optimal is choosing -nRange or nRange
int solve(vector<int>&v){
    int n = (int)v.size();
    vector<int> res;
    for (int i = 0; i < n; ++i){
        auto iter = lower_bound(res.begin(), res.end(), v[i]);
        if (iter == res.end()) res.push_back(v[i]);
        else *iter = v[i];
    }
    return (int)res.size();
}
void Whisper(){
    cin >> nArr >> nRange;
    for (int i = 1; i <= nArr; ++i) cin >> a[i];
    vector<int> b, c;
    for (int i = 1; i <= nArr; ++i){
        b.push_back(a[i]);
        b.push_back(a[i] - nRange);

        c.push_back(a[i] + nRange);
        c.push_back(a[i]);
    }

    //find the longest increasing which includes non - adjacent elements
    int ans = max(solve(b), solve(c));
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

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