Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years.
×

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

1 | MiFaFaOvO | 3681 |

2 | tourist | 3404 |

3 | TLE | 3356 |

4 | apiadu | 3351 |

5 | mnbvmar | 3281 |

6 | LHiC | 3276 |

7 | Um_nik | 3268 |

8 | 300iq | 3267 |

9 | yosupo | 3249 |

10 | ainta | 3226 |

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

1 | Errichto | 190 |

2 | antontrygubO_o | 186 |

3 | tourist | 182 |

4 | Radewoosh | 169 |

5 | vovuh | 167 |

6 | pikmike | 166 |

7 | ko_osaga | 161 |

8 | Um_nik | 160 |

9 | Petr | 155 |

10 | McDic | 153 |

You start with an array containing all zeroes. You will be given some updates. Updates are in the form $$$L, R, A, B$$$. For each update, you have to add $$$A+(i-L)*B$$$ for each $$$L \leq i \leq R$$$. You will have to answer queries in the form $$$L, R$$$. For each query, you have answer what's the maximum element in $$$[L, R]$$$ range.

The range sum query version of this problem can be solved with segment tree with lazy propagation. However, I can't think of a way to solve this one.

Hello there!

There will be a contest for the freshmen of CSE department, BUET. We will be hosting a replay of the contest on CodeChef on 9 PM BST (3 PM UTC). It is an open contest. Anyone can participate in the contest. The contest duration is 3 hours. Here's the contest link: https://www.codechef.com/BCRR2018

The problems would be rather observation and implementation based than algorithmic nature. So, you don't need to know complex classical algorithms to do better in the contest!

Problemsetters: solaimanope, anachor, cgspyn_868, Fullmetal_Algorithmist, Redwan_Plague, The_WA_Master, rebornplusplus, RakibulHasan, rogue_33

**Update:** Editorial

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/20/2020 18:42:49 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|