Submission #677128

#TimeUsernameProblemLanguageResultExecution timeMemory
677128omikron123Rabbit Carrot (LMIO19_triusis)C++14
100 / 100
27 ms3008 KiB
#include<iostream> #include <algorithm> #include<vector> using namespace std; const int maxn = 200005; int n,m; vector<int> dp; int main () { scanf("%d%d",&n,&m); dp.push_back(-m*n); for(int i = 0; i < n; i++) { int a; scanf("%d",&a); a += m*(n-i-1); a *= -1; vector<int>::iterator tmp = upper_bound(dp.begin(),dp.end(),a); if(tmp != dp.begin()) { if(tmp != dp.end()) *tmp = a; else dp.push_back(a); } } printf("%lu\n",n-dp.size()+1); return 0; }

Compilation message (stderr)

triusis.cpp: In function 'int main()':
triusis.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
triusis.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d",&a);
      |         ~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...