Submission #1354167

#	Time	Username	Problem	Language	Result	Execution time	Memory
1354167		AtinaR	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	45 ms	3508 KiB

triusis

#include <bits/stdc++.h>

using namespace std;
const int MAX=2*1e5+10;
const int INF=(1<<30);
int n,m;
int arr[MAX];

int main()
{
    cin>>n>>m;
    vector<int> v;
    for(int i=0; i<n; i++)
    {
        cin>>arr[i];
        int tmp=arr[i]-(i+1)*m;
        if(tmp<=0)v.push_back(tmp);
    }
    if(v.empty())
    {
        cout<<n<<endl;
        return 0;
    }
    int mxx=0;
    vector<int> lis;
    for(auto x:v)
    {
        x=-x;
        auto it=upper_bound(lis.begin(),lis.end(),x);
        if(it==lis.end())lis.push_back(x);
        else *it=x;
    }
    cout<<n-lis.size()<<endl;
    return 0;
}

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