Table of Contents

Approach 1 - Prefix/Suffix Sums Code Approach 2 - DP Bonus - An \mathcal{O}(N \log N) Solution Edit on Github

POI 2014 - Hotels

Author: Andi Qu

Table of Contents

Approach 1 - Prefix/Suffix Sums Code Approach 2 - DP Bonus - An \mathcal{O}(N \log N) Solution

The following two hints apply for all three approaches:

Hint 1

Hint 2

Approach 1 - Prefix/Suffix Sums

Hint 3

Solution

Approach 2 - DP

This section is not complete.

Feel free to file a request to complete this using the "Contact Us" button.

Bonus - An $\mathcal{O}(N \log N)$ Solution

This section is not complete.

Feel free to file a request to complete this using the "Contact Us" button.

See the Polish editorial for more details.

Give Us Feedback on POI 2014 - Hotels!

Join the Discussion!

Feel free to voice your thoughts in the comments section.

Need help? Join the USACO Forum!