POJ 2709 水题

[题目(http://poj.org/problem?id=2709)

水题 最后配灰色的时候一毫升一毫升的配

代码：

#include <cstdio>
#include <iostream>
#include <queue>
#include <cstring>
#define sf scanf
#define pf printf
using namespace std;
const int maxn = 10;
int a[maxn];
int main(){
    int n;
    while( sf("%d",&n) != EOF && n ){
        int max_num = 0;
        for(int i = 1;i <= n + 1;++i){
            sf("%d",&a[i]);
            if(i <= n) max_num = max(max_num , a[i]);
        }
        int ans = (max_num + 49) / 50;
        priority_queue<int> p;
        for(int i = 1;i <= n;++i){
            p.push(ans * 50 - a[i]);
        }
        while( true ){
            if(a[n + 1] <= 0) break;
            int A[3];
            for(int i = 0;i < 3;++i){
                A[i] = p.top();p.pop();
            }
            if(!A[0] || !A[1] || !A[2]){
                ans++;
                a[1] = A[0] + 50;
                a[2] = A[1] + 50;
                a[3] = A[2] + 50;
                for(int i = 4;i <= n;++i){
                    a[i] = p.top() + 50;
                    p.pop();
                }

                for(int i = 1;i <= n;++i){
                    p.push(a[i]);
                }
                continue;
            }

            for(int i = 0;i < 3;++i){
                p.push(A[i] - 1);
            }
            a[n + 1] -= 1;
        }

        pf("%d\n",ans);
    }
    return 0;
}