Competitive Branch Contest #3
Welcome to the third competitive contest of the year!
You have 30 minutes to solve three problems of increasing difficulty. Each problem is worth a total of points, and there is a bonus of
staggering points for solving on the first try. This is to encourage testing your code locally and coding more bug-free.
These problems will revolve around the topics we covered last week (Array-based data structures).
Starting from this contest, there will be an access code, which you will receive only if you come to the meeting.
Good luck!
Problems
| Problem | Points | AC Rate | Users |
|---|---|---|---|
| Difference Array Simulation | 3p | 85.1% | 59 |
| Subarray Maximization | 10p | 24.2% | 40 |
| A Difference Array Problem | 15p | 14.6% | 27 |
Comments
Can I get carried?