# | User | Rating |
---|---|---|

1 | tourist | 3624 |

2 | Um_nik | 3468 |

3 | mnbvmar | 3363 |

4 | Petr | 3330 |

5 | wxhtxdy | 3329 |

6 | LHiC | 3300 |

7 | sunset | 3278 |

8 | V--o_o--V | 3275 |

9 | Vn_nV | 3182 |

10 | dotorya | 3156 |

# | User | Contrib. |
---|---|---|

1 | Radewoosh | 191 |

2 | Errichto | 184 |

3 | rng_58 | 160 |

4 | PikMike | 159 |

5 | Petr | 156 |

6 | Vovuh | 153 |

6 | Um_nik | 153 |

6 | neal | 153 |

9 | Ashishgup | 152 |

10 | majk | 151 |

10 | 300iq | 151 |

↑

↓

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/21/2019 19:58:56 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

I'll try to explain my solution. Firstly, I hope you get that you never need to make more than 2 triples of the format [x, x + 1, x + 2] (Claim 1). Now create a tile frequency array from 1 to m. We'll apply DP on this starting from 1 till m. DP state is dp[i][j][k], where i is the last index of the prefix considered, j is the number of tiles remaining of size (i — 1) and k is the number of tiles remaining of size i. Because of the claim 1, we never need to store more than 2 tiles of size (i — 1) and 4 tiles of size i for later operation (Why?). To make the transition to (i + 1), you can iterate for all possible values of j and k. https://codeforces.com/contest/1110/submission/49606713. (Note that DP state with -1 as value is representing the impossible state.)

Firstly, I hope you get that you never need to make more than 2 triples of the format [x, x + 1, x + 2]--> sorry , but i didn't get . what will happen if we take 3 triplets , will it lead to wa ?Thanks PrakharJain , i get it . 4 tiles of size i is bcoz 2 for i-1 and i pair and 2 for i and i+1 pair . its quite hard to come up with this idea on own .

No. Because you can always replace 3 triples of this format to 3 triples [x, x, x], [x + 1, x + 1, x + 1] and [x + 2, x + 2, x + 2].

At first, let's notice that it isn't worth taking 3 times or more [

x,x+ 1,x+ 2], we can take [x,x,x], [x+ 1,x+ 1,x+ 1], [x+ 2,x+ 2,x+ 2] instead.Now let's compute how many times number

xis present for any validx. Denote the value bycnt[x].Now let's calculate

dp[i][j][k] (in this dp we consider all numbers from the given array that are less thani- 1,cnt[i- 1] -k(k is up to 3) numbers which are equals toi- 1 andjnumbers which are equal toi(j is up to cnt[i]),dp[i][j][k] is the answer for these numbers)How to calculate it? As we know, there is no point in taking 3 times [

x,x+ 1,x+ 2], sodp[i][j][k] =max(dp[i- 1][cnt[i] -l][l] + (j-l) / 3),l< 3. That's because we can take [i- 2,i- 1,i] 0, 1 or 2 times. If we take itltimes, than we have (j-l) numbers that are equals to i and we have to divide them into groups of the type [i, i, i]. Also we have to divide the other numbers, but we know that the answer, it is dp[i — 1][cnt[i] — l][l]Hope, my answer will help you. Ask me if you have any questions :D

thanks i get it . Miraak

Hi, Can you please explain why "it isn't worth taking 3 times or more [x, x + 1, x + 2]". Because in both the cases I am having the answer as 3. What advantage I am having by considering [x, x, x], [x + 1, x + 1, x + 1], [x + 2, x + 2, x + 2] instead of 3 times of [x, x + 1, x + 2].