XtraFormations

  Codeforces Round 857 (Div. 2)                                              B. Settlement of Guinea Pigs   Dasha loves guinea pigs very much. In this regard, she decided to settle as many guinea pigs at home as possible and developed a plan for the next n  days. Every day, she will either buy a new guinea pig or call a doctor to examine all her pets. Unfortunately, the store where she was going to buy guinea pigs does not understand them. Therefore, it cannot determine their gender. Dasha can't do it either. The only one who can help is a doctor. To keep guinea pigs, aviaries are needed. Dasha plans to buy them in the same store. Unfortunately, only one species is sold there — a double aviary. No more than two guinea pigs can live in it. Since Dasha does not want to cause moral injury to her pets — she will not settle two guinea pigs of d...

B: Maximum Substring  A binary string is a string consisting only of the characters   0   and   1 . You are given a binary string  s. For some non-empty substring † †   t t  of string  s s  containing  x x  characters  0  and  y y  characters  1 , define its  cost  as: x ⋅ y x ⋅ y , if  x > 0 x > 0  and  y > 0 y > 0 ; x 2 x 2 , if  x > 0 x > 0  and  y = 0 y = 0 ; y 2 y 2 , if  x = 0 x = 0  and  y > 0 y > 0 . Given a binary string  s s  of length  n n , find the maximum cost across all its non-empty substrings. † †  A string  a  is a substring of a string  b  if  a a  can be obtained from  b  by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end. Input Each test consists of multiple test cas...