Submission #1019398

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019398		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	0 ms	348 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

int m,n,x=0;

int main() {
    cin >> n >> m;
    int a[n+2];
    for(int i =1; i <= n; i++){
        cin >> a[i];
        
    }
    vector<int>dp(n+2,2e9+50);
 
    int lis=1;
 
    for(int i=0;i<=n+1;i++)
    {
        int pos=upper_bound(dp.begin(),dp.end(),-(a[i]-i*m))-dp.begin();
        if(pos!=0 || i==0)dp[pos]=-(a[i]-i*m);
        lis=pos+1;
    }
 
    cout<<n-(lis-2);
}

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