Submission #622733

#	Time	Username	Problem	Language	Result	Execution time	Memory
622733		ipaljak	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	91 ms	12308 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 10;

int n, m;
int a[MAXN];

int lis() {
  multiset<int> s;
  multiset<int>::iterator it;
  for (int i = 1; i <= n; ++i) {
    if (a[i] > 0) continue;
    s.insert(-a[i]);
    it = s.upper_bound(-a[i]);
    if (it != s.end()) s.erase(it);
  }
  return s.size();
}

int main(void) {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    a[i] -= m * i;
  }

  //for (int i = 0; i <= n; ++i)
    //cerr << a[i] << " ";
  //cerr << endl;

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

Compilation message (stderr)

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

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