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

1 | tourist | 3757 |

2 | jiangly | 3647 |

3 | Benq | 3581 |

4 | orzdevinwang | 3570 |

5 | Geothermal | 3569 |

5 | cnnfls_csy | 3569 |

7 | Radewoosh | 3509 |

8 | ecnerwala | 3486 |

9 | jqdai0815 | 3474 |

10 | gyh20 | 3447 |

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

1 | maomao90 | 171 |

2 | awoo | 164 |

2 | adamant | 164 |

4 | TheScrasse | 159 |

5 | nor | 154 |

5 | maroonrk | 154 |

7 | -is-this-fft- | 152 |

8 | Petr | 147 |

9 | orz | 146 |

10 | pajenegod | 145 |

Comments

0
How to solve problem F? |

-6
Hope strong pretests.Come Up~ |

+3
I like this kind of contest with strong pretests. For problem D, enumerate the ending points of all values, and then count the number of new values $$$a$$$ each time, and the number of values that are still ending before $$$b$$$. The added contribution of the answer is: COMB(a + b, k) — COMB(b, k). |

0
If a[i] is greater than a[i-1] and a[i+1], add a[i] to the answer. If a[i] is less than a[i-1] and a[i+1], subtract a[i] from the answer. And let a[0]=a[n+1]=0. Change the contribution of up to 6 positions per exchange. Complexity: O(n). |

-8
Does anyone check the correctness of the problem A??? Bad experience! |

0
Can problem D find legal arrays of $$$b$$$ and $$$c$$$? upd:Oh, yes, it can be done. |

+5
Problem D. I don't sure it's correctness. a[n]=n*(a[n-1]-1) starting with a[1]=3. ans = n!*(n-2) + a[n-2] |

0
Happy new year! I finally experienced the gray rank!Wowo! Try to experience all kinds of color in Codeforces. |

+1
The internet of machine room is out of service, sadly I have to use my wifi to play codeforces.... |

-31
I dont know the rules of CF.And the other account is mine too.I submit my code on my account and i submit it with this account. Whatever,i am sorry for this thing happened. |

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/30/2024 07:04:37 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|