Submission #384050

#	Time	Username	Problem	Language	Result	Execution time	Memory
384050		iulia13	Global Warming (CEOI18_glo)	C++14	0 / 100	131 ms	3988 KiB

glo

#include <iostream>

using namespace std;
const int nmax = 2e5 + 5;
int dp[nmax];
int dp2[nmax];
int v[nmax];
int a[nmax];
int bs(int st, int dr, int val, int a[])
{
    int x = 0;
    while (st <= dr)
    {
        int mid = (st + dr) / 2;
        if (a[mid] >= val)
        {
            x = mid;
            st = mid + 1;
        }
        else
            dr = mid - 1;
    }
    return x;
}
int main()
{
    int n, x, i, l = 0, ans = 0;
    cin >> n >> x;
    for (i = 1; i <= n; i++)
        cin >> v[i];
    for (i = n; i; i--)
    {
        int poz = bs(1, l, v[i], a);
        dp[i] = poz + 1;
        if (poz == l)
            l++;
        a[poz + 1] = v[i];
        ans = max(ans, dp[i]);
    }
    l = 0;
    for (i = 1; i <= n; i++)
    {
        int poz = bs(1, l, -(v[i] + x), a);
        ans = max(ans, dp[i] + poz - 1);
        poz = bs(1, l, -v[i], a);
        if (poz == l)
            l++;
        a[poz + 1] = -v[i];
    }
    cout << ans;
    return 0;
}

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