Submission #1164850

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164850		Muhammad_Aneeq	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <set>
#include <vector>
#include <algorithm>
#warning check the output
using namespace std;
#define int long long
inline void solve()
{
    int n,k;
    cin>>n>>k;
    int a[n+1];
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        a[i]=k*i-a[i];
    }
    vector<int>ls;
    for (int i=1;i<=n;i++)
    {
        int s=upper_bound(begin(ls),end(ls),a[i])-begin(ls);
        if (s==ls.size())
            ls.push_back(a[i]);
        else
            ls[s]=a[i];
    }
    cout<<n-ls.size()<<endl;
}
signed main()
{
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

Compilation message (stderr)

triusis.cpp:11:2: warning: #warning check the output [-Wcpp]
   11 | #warning check the output
      |  ^~~~~~~

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