oj.uz

Submission #521745

# Submission time Handle Problem Language Result Execution time Memory
521745 2022-02-03T00:49:06 Z penguin133 Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;

int dp[200005], A[200005];

int main(){
	int n,m, maxi =0 ;cin >> n >> m;
	for(int i=1;i<=n;i++)cin >> A[i];
	for(int i=1;i<=n;i++){
		if(A[i] > m * i)dp[i] = -1e9;
		else {
			for(int j=0;j<=i;j++)if(A[i] - m <= A[j])dp[i] = max(dp[i], dp[j] + 1);
		}
		maxi = max(maxi, dp[i]);
	}
	cout << n-maxi;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -