oj.uz

답안 #1038593

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038593 2024-07-30T02:59:13 Z vjudge1 Global Warming (CEOI18_glo) C++17
17 / 100
 39 ms 5444 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define lwb lower_bound
#define upb upper_bound

#define TASKNAME "NAME"

void init()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///freopen(TASKNAME".INP","r",stdin); freopen(TASKNAME".OUT","w",stdout);
}

const int maxN = 1e6+5;
const ll INF = INT_MAX / 2, MOD = 1e9+7, INFLL = 2e18;
const double epsilon = 1e-3;

int n, x, a[maxN], b[maxN];
pii lo[maxN], hi[maxN];

int main()
{
    init();
    cin >> n >> x;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        b[i] = INF;
    }
    b[0] = -INF;
    for(int i = 1; i <= n; i++)
    {
        int pos = lower_bound(b, b + n + 1, a[i]) - b;
        b[pos] = a[i];
        //cout << a[i] << " " << pos << '\n';
        if(pos > lo[i-1].fi)
        {
            lo[i] = {pos, a[i]};
        } else if(pos == lo[i-1].fi && a[i] < lo[i-1].se)
        {
            lo[i].fi = lo[i-1].fi;
            lo[i].se = a[i];
        } else
        {
            lo[i] = lo[i-1];
        }
    }
    for(int i = 1; i <= n; i++)
    {
        b[i] = INF;
    }
    b[0] = -INF;
    int res = lo[n].fi;
    for(int i = n; i >= 1; i--)
    {
        int p = lower_bound(b, b + n + 1, -a[i] + x) - b;
        res = max(res, lo[i].fi + p - 1);
        int pos = lower_bound(b, b + n + 1, -a[i]) - b;
        b[pos] = -a[i];
    }
    cout << res;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 39 ms 3416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 1112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1884 KB Output is correct
2 Correct 18 ms 2904 KB Output is correct
3 Correct 36 ms 5444 KB Output is correct
4 Correct 29 ms 4696 KB Output is correct
5 Correct 15 ms 2392 KB Output is correct
6 Correct 31 ms 4664 KB Output is correct
7 Correct 28 ms 5292 KB Output is correct
8 Correct 17 ms 2908 KB Output is correct

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -