Submission #1041781

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041781		_maniac	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	18 ms	10072 KiB

triusis

#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds; 
#define int long long
#define shinobu ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
const int mod = 1e9 + 7;  
const int mod2 = 998244353;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;// find_by_order, order_of_key  
void solve(){   
     int n,m; 
     cin>>n>>m; 
     vector<int>a(n);  
     for(int i=0;i<n;++i) cin>>a[i]; 
       
     vector<int>b;
     for(int i=1;i<=n;++i){ 
          if((i*m)>=a[i-1]) b.pb(i*m-a[i-1]);
     }  
     auto LNDS=[&](vector<int>b){  
           vector<int>dp; 
           for(int i=0;i<b.size();++i){
              int j=upper_bound(dp.begin(),dp.end(),b[i])-dp.begin(); 
              if(j==dp.size()) dp.pb(b[i]); 
              else             dp[j]=b[i];
           } 
           return dp.size();
     }; 
     cout<<n-LNDS(b)<<'\n';
}
signed main(){     
    shinobu; 
    int T;
    T=1; 
    while(T--){
         solve();
    }
}

Compilation message (stderr)

triusis.cpp: In lambda function:
triusis.cpp:27:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |            for(int i=0;i<b.size();++i){
      |                        ~^~~~~~~~~
triusis.cpp:29:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |               if(j==dp.size()) dp.pb(b[i]);
      |                  ~^~~~~~~~~~~

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