제출 #1285307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285307		limon4ick	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	1096 ms	3532 KiB

triusis

/*#pragma GCC optimize("Ofast,no-stack-protector,unroint-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroint-loops")
#pragma ("reroint") */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ins insert
#define F first
#define S second
const int mod = 1e9 + 7,N = 2e5 + 100,mx = 1e9 + 7;
int dp[N];
int a[N];
signed main(){
    //freopen("justcoding.in","r",stdin);
    //freopen("justcoding.out","w",stdout);
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin >> n >> m;
    for(int i = 1;i<=n;i++){
        cin >> a[i];
        a[i] -= i * m;
    }
    dp[0] = 0;
    a[0] = 0;
    for(int i = 1;i<=n;i++) dp[i] = -INT_MAX;
    int mx = 0;
    for(int i = 1;i<=n;i++){
        for(int j = 0;j<i;j++){
            if(a[j]>=a[i]){
                dp[i] = max(dp[i],dp[j] + 1);
            }
        }
        mx = max(mx,dp[i]);
    }
    cout << n - mx;
}

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