Submission #749265

#	Time	Username	Problem	Language	Result	Execution time	Memory
749265		PanosPask	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	40 ms	4572 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, m;
vector<int> a;
vector<ll> d;

int main(void)
{
    scanf("%d %d", &n, &m);

    a.resize(n);
    d.assign(n+1, INT_MIN);

    for (int i = 0; i < n; i++)
        scanf("%d", &a[i]);

    d[0] = INT_MAX;
    for (int i = 0; i < n; i++) {
        ll curval = a[i] - m * (i + 1);
        if (curval > 0)
            continue;
        int l = 0;
        int r = n + 1;
        while (r > l + 1) {
            int mid = (l + r) / 2;
            if (d[mid] >= curval)
                l = mid;
            else
                r = mid;
        }

        d[l+1] = curval;
    }

    int ans = 0;
    for (int i = 0; i < n + 1; i++)
        if (d[i] != INT_MIN)
            ans = i;

    printf("%d\n", n - ans);
    return 0;
}

Compilation message (stderr)

triusis.cpp: In function 'int main()':
triusis.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
triusis.cpp:19:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37