| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 161 |
| 2 | maomao90 | 160 |
| 3 | awoo | 159 |
| 4 | atcoder_official | 157 |
| 5 | -is-this-fft- | 155 |
| 5 | nor | 155 |
| 5 | adamant | 155 |
| 8 | Um_nik | 152 |
| 8 | maroonrk | 152 |
| 10 | djm03178 | 146 |
Need Help to solve problem..(Google Coding Challenge)
Two type of operations
Type1: replace A[i] by A[i-1]
Type2: Replace A[i] to 0.
Determine maximum length of subarray that can be obtained if all elements of subarray are zero and you can apply max operations of x and y of type 1 and 2 respectively.
Constraints: 1<=T<=7
1<=N<=1e5
0<=A[i]<=1e9
0<=Y<=1e9
0<=X<=1e14
