Submission #163780

# Submission time Handle Problem Language Result Execution time Memory
163780 2019-11-15T09:25:58 Z Alexa2001 Global Warming (CEOI18_glo) C++17
100 / 100
231 ms 7076 KB
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 2e5 + 5;

pair<int,int> a[Nmax];
int A[Nmax];
int dp1[Nmax], dp2[Nmax];
int X, n;

class AIB 
{
    int b[Nmax];

    int query(int p)
    {
        int ans = 0;
        for(; p<=n; p+=ub(p))
            ans = max(ans, b[p]);
        return ans;
    }

    void update(int p, int val)
    {
        for(; p; p-=ub(p)) b[p] = max(b[p], val);
    }
    
    int ub(int x) { return (x&(-x)); }

public:
    void clear()
    {
        memset(b, 0, sizeof(b));
    }
    
    int query_greater(int x)
    {
        int p = lower_bound(a+1, a+n+1, make_pair(x+1, 0)) - a;
        return query(p);
    }

    void update_greater(int x, int val)
    {
        int p = lower_bound(a+1, a+n+1, make_pair(x, 0)) - a;
        update(p, val);
    }

    int query_smaller(int x)
    {
        int p = lower_bound(a+1, a+n+1, make_pair(x, 0)) - a - 1;
        return query(n + 1 - p);
    }

    void update_smaller(int x, int val)
    {
        int p = lower_bound(a+1, a+n+1, make_pair(x, 0)) - a;
        update(n+1-p, val);
    }
} aib;

void norm()
{
    int i;
    for(i=1; i<=n; ++i)
        a[i] = {A[i], i};

    sort(a+1, a+n+1);
}

void solve()
{
    int i;

    aib.clear();
    for(i=n; i; --i)
    {
        dp2[i] = aib.query_greater(A[i]) + 1;
        aib.update_greater(A[i], dp2[i]);
    }
    
    int ans = 0;
    aib.clear();
    for(i=1; i<=n; ++i)
    {
        int curr_ans = aib.query_smaller(A[i] + X) + dp2[i];
        ans = max(ans, curr_ans);

        dp1[i] = aib.query_smaller(A[i]) + 1;
        aib.update_smaller(A[i], dp1[i]);
    }
    
    cout << ans << '\n';
}

int main()
{
   // freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);

    cin >> n >> X;

    int i;
    for(i=1; i<=n; ++i) cin >> A[i];

    norm();
    solve();

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 4 ms 1148 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1276 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 4 ms 1148 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1276 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 3 ms 1144 KB Output is correct
18 Correct 3 ms 1148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 4 ms 1148 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1276 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 3 ms 1144 KB Output is correct
18 Correct 3 ms 1148 KB Output is correct
19 Correct 3 ms 1144 KB Output is correct
20 Correct 3 ms 1144 KB Output is correct
21 Correct 3 ms 1144 KB Output is correct
22 Correct 3 ms 1144 KB Output is correct
23 Correct 3 ms 1148 KB Output is correct
24 Correct 3 ms 1144 KB Output is correct
25 Correct 3 ms 1144 KB Output is correct
26 Correct 3 ms 1144 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 231 ms 6984 KB Output is correct
2 Correct 229 ms 6928 KB Output is correct
3 Correct 228 ms 6976 KB Output is correct
4 Correct 229 ms 6892 KB Output is correct
5 Correct 105 ms 6224 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 57 ms 2584 KB Output is correct
2 Correct 53 ms 2680 KB Output is correct
3 Correct 52 ms 2552 KB Output is correct
4 Correct 27 ms 2424 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 29 ms 2424 KB Output is correct
7 Correct 48 ms 2552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 99 ms 4060 KB Output is correct
2 Correct 112 ms 4060 KB Output is correct
3 Correct 218 ms 7076 KB Output is correct
4 Correct 102 ms 6252 KB Output is correct
5 Correct 60 ms 3704 KB Output is correct
6 Correct 100 ms 6148 KB Output is correct
7 Correct 105 ms 6776 KB Output is correct
8 Correct 80 ms 4088 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 4 ms 1148 KB Output is correct
5 Correct 3 ms 1148 KB Output is correct
6 Correct 3 ms 1276 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 3 ms 1144 KB Output is correct
15 Correct 3 ms 1144 KB Output is correct
16 Correct 3 ms 1144 KB Output is correct
17 Correct 3 ms 1144 KB Output is correct
18 Correct 3 ms 1148 KB Output is correct
19 Correct 3 ms 1144 KB Output is correct
20 Correct 3 ms 1144 KB Output is correct
21 Correct 3 ms 1144 KB Output is correct
22 Correct 3 ms 1144 KB Output is correct
23 Correct 3 ms 1148 KB Output is correct
24 Correct 3 ms 1144 KB Output is correct
25 Correct 3 ms 1144 KB Output is correct
26 Correct 3 ms 1144 KB Output is correct
27 Correct 231 ms 6984 KB Output is correct
28 Correct 229 ms 6928 KB Output is correct
29 Correct 228 ms 6976 KB Output is correct
30 Correct 229 ms 6892 KB Output is correct
31 Correct 105 ms 6224 KB Output is correct
32 Correct 57 ms 2584 KB Output is correct
33 Correct 53 ms 2680 KB Output is correct
34 Correct 52 ms 2552 KB Output is correct
35 Correct 27 ms 2424 KB Output is correct
36 Correct 3 ms 1144 KB Output is correct
37 Correct 29 ms 2424 KB Output is correct
38 Correct 48 ms 2552 KB Output is correct
39 Correct 99 ms 4060 KB Output is correct
40 Correct 112 ms 4060 KB Output is correct
41 Correct 218 ms 7076 KB Output is correct
42 Correct 102 ms 6252 KB Output is correct
43 Correct 60 ms 3704 KB Output is correct
44 Correct 100 ms 6148 KB Output is correct
45 Correct 105 ms 6776 KB Output is correct
46 Correct 80 ms 4088 KB Output is correct
47 Correct 108 ms 4064 KB Output is correct
48 Correct 108 ms 4092 KB Output is correct
49 Correct 227 ms 6912 KB Output is correct
50 Correct 102 ms 6220 KB Output is correct
51 Correct 93 ms 4896 KB Output is correct
52 Correct 128 ms 6264 KB Output is correct
53 Correct 106 ms 6264 KB Output is correct
54 Correct 111 ms 7032 KB Output is correct
55 Correct 180 ms 6964 KB Output is correct