oj.uz

Submission #1083471

# Submission time Handle Problem Language Result Execution time Memory
1083471 2024-09-03T09:03:06 Z knot222 Global Warming (CEOI18_glo) C++14
10 / 100
 94 ms 11624 KB 
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
const ll inf = 1e10;
int main()
{
    ll N,X;
    cin>>N>>X;
    vector<ll> a(N+10);
    vector<ll> b(N+10);
    for (int i=1;i<=N;i++) {
        cin>>a[i];
        b[N+1-i] = -a[i];
    }
    vector<ll> l1(N+10, inf);
    vector<ll> ll1(N+10,inf);
    l1[0] = -inf;
    for (int i=1;i<=N;i++) {
        int l = upper_bound(l1.begin()+1, l1.end(), a[i]) - (l1.begin());
        if (l1[l-1] < a[i] && a[i] < l1[l]) {
            l1[l] = a[i];
        }
        ll1[i] = l;
    }
    vector<ll> l2(N+10, inf);
    vector<ll> ll2(N+10,inf);
    l2[0] = -inf;
    for (int i=1;i<=N;i++) {
        int l = upper_bound(l2.begin()+1, l2.end(), b[i]) - (l2.begin());
        if (l2[l-1] < b[i] && b[i] < l2[l]) {
            l2[l] = b[i];
        }
        ll2[N+1-i] = l;
    }
    ll ans = 0;
    for (int i=1;i<N;i++) {
        if (a[i]-X+1<=a[i+1]) {
            //cout << ans;
            ans = max(ans, ll1[i]+ll2[i+1]);
        }
    }
    cout << ans;
    return 0;
}
/*
8 10
7 3 5 12 2 7 3 4 
*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 11600 KB Output is correct
2 Correct 68 ms 11596 KB Output is correct
3 Correct 94 ms 11600 KB Output is correct
4 Correct 67 ms 11624 KB Output is correct
5 Correct 46 ms 10832 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3140 KB Output is correct
2 Correct 18 ms 3256 KB Output is correct
3 Correct 17 ms 3156 KB Output is correct
4 Incorrect 12 ms 2908 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5972 KB Output is correct
2 Incorrect 40 ms 5972 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -