| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1134064 | alexdd | Rabbit Carrot (LMIO19_triusis) | C++20 | 1093 ms | 2396 KiB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9;
int n,m;
int a[200005],dp[200005];
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
n++;
a[n]=0;
for(int i=1;i<=n;i++)
{
dp[i] = INF;
for(int j=i-1;j>=0;j--)
{
if(a[j]-j*m >= a[i]-i*m)
{
dp[i] = min(dp[i], dp[j]-j);
}
}
dp[i]+=i-1;
}
cout<<dp[n];
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
