답안 #815693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815693 2023-08-08T18:49:54 Z AmrT Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
1 ms 212 KB
    #include <bits/stdc++.h>
    #define lop(i,a,b) for(ll i = a; i < b; i++)
    #define alop(i,v) for(auto &i: v)
    #define in(v) for(auto &i: v) cin >> i;
    #define ll long long
    #define endl '\n'
    #define pb push_back
    #define all(v) v.begin(),v.end()
    #define mem(p, x) memset(p, x, sizeof(p))
    using namespace std;
    ll mod = 1e9 + 7;

    int main(){
        ll n, m; cin >> n >> m;
        ll arr[n + 1] = {}, dp[n + 1] = {};
        lop(i, 0, n) cin >> arr[i + 1];
        
        if(m >= arr[1]) dp[1] = 1;

        ll ans = dp[1];
        for(int i = 2; i <= n; i++){
            for(int j = 1; j < i; j++){
                if(arr[j] + m * (i - j) >= arr[i]) dp[i] = max(dp[i], dp[j] + 1);
            }
            ans = max(ans, dp[i]);
        }
        
        cout << n - ans;

        return 0;
    }
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -