Submission #329414

#	Time	Username	Problem	Language	Result	Execution time	Memory
329414		CSQ31	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	102 ms	5484 KiB

triusis

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	ll n,m;
	cin>>n>>m;
	vector<ll>a(n+1);
	a[0] = 0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i] = i*m - a[i];
	}
	//for(int i=0;i<=n;i++)cout<<a[i]<<" ";
	//cout<<'\n';
	vector<ll>dp(n+1,INF);
	dp[0] = 0;
	int ans = 0;
	for(int i=1;i<=n;i++){
		int p = ub(all(dp),a[i])-dp.begin();
		if(p == 0)continue;
		dp[p] = min(dp[p],a[i]);
		ans = max(ans,p);
	}
	//cout<<ans<<'\n';
	cout<<n-ans<<'\n';
}

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