제출 #590500

#제출 시각아이디문제언어결과실행 시간메모리
590500lamRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> #define taskname "cowjog" #define maxn 200010 #define ff first #define ss second #define int long long using namespace std; int n,T; int a[maxn],dp[maxn]; int ans=0; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); // freopen(taskname".in","r",stdin); // freopen(taskname".out","w",stdout); cin>>n>>T; for (int i=1; i<=n; i++) { int x; cin>>x; a[i]=x-i*T; a[i]=-a[i]; } fill_n(dp,n+1,2*1e18); dp[0]=-2*1e18; for (int i=1; i<=n; i++) { int j=upper_bound(dp,dp+n+1,a[i])-dp; ans=max(ans,j); dp[j]=a[i]; } cout<<n-ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...