제출 #912284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
912284		vjudge1	Rabbit Carrot (LMIO19_triusis)	C++17	14 / 100	14 ms	496 KiB

triusis

// #pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")  
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define sz(x) (int)x.size()
#define bit(a, i) ((a>>i)&1)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int P = 18;
const int K = 800;
const ll INF = 2e18;
const int inf = 1e9;
const int mod = 1e9+7;
const int maxm = 5e2+10;
const int maxn = 2e5+10;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {1, -1, 0, 0};

int n, m;
int a[maxn];
int dp[maxn];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> m;
    int ans = n;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        dp[i] = inf;
        for(int j=i-1; j>=max(0, i-1000); j--){
            if((i-j)*1ll*m+a[j] >= a[i]){
                dp[i] = min(dp[j]+i-j-1, dp[i]);
            }
        } ans = min(ans, dp[i]+n-i);
    } cout << ans;
}

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