Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×
interesting problem
Difference between en2 and en3, changed 6 character(s)
you are given an array **A** of $n$ positive integers ( $0<A[i]<10^9$ ) and $r$ moves.↵
↵
on each move:↵
you can choose any subarray of **A** (which contains only positive elements) and decrease all elements in that subarray by one.↵
↵
your task is to maximize the number of $0$ values in your array.↵
↵
print that number after $r$ moves.↵
↵
**input:**↵
↵
- $n,r$↵
↵
- $A[1],A[2],..A[n]$↵
↵
↵
**ouput:**↵
↵
- number of $0$ values after r moves↵
↵
**example input:**↵
↵
$6$ $2$↵
↵
$0$ $2$ $1$ $2$ $2$ $3$↵
↵
**output**↵
↵
$4$↵
↵
↵
↵
↵
- **subtask1:** $n<=10;r=1$↵
- **subtask2:** $n<=10;r<=5$↵
- **subtask23:** $n<=200;r<=200$↵
- **subtask24:** $n<=200;r<=10^9$↵
- **subtask25:** $n<=2000;r<=10^9$↵

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English TuHoangAnh 2022-07-14 15:51:45 6
en2 English TuHoangAnh 2022-07-14 15:48:16 378 Tiny change: 'n\n$4$\n\n' -> 'n\n$4$\n\n- **subtask1:** $n<=10;r=1$\n- **subtask2:** $n<=10;r=1$\n' (published)
en1 English TuHoangAnh 2022-07-14 15:30:23 354 Initial revision (saved to drafts)