POJ 3104 Drying binary

 

Question:

There are n pieces of clothing, each piece of ai water, natural air drying less than 1 per minute, while drying Less Than k per minute. Obtain the shortest time for all tasks.

Ideas:

Note that there is no natural drying during drying.

Can be understood as drying every minute (k-1) of water.

In this way, each dress loses 1 water every minute.

The minimum value of the binary enumeration.

 

# Include

 
  
# Define deusing namespace std; const int MAXN = 100000 + 10; int a [MAXN]; int n, k; bool OK (int x) {int t = 0; for (int I = n-1; I> = 0; I --) {if (a [I] <= x) break; else t = t + (a [I] + k-2-x)/(k-1); if (t> x) return false;} return true;} int main () {while (~ Scanf (% d, & n) {for (int I = 0; I