Cod sursa(job #1283135)

Utilizator BogdacutuSeniuc Bogdan Bogdacutu Data 5 decembrie 2014 09:15:28
Problema Transport Scor 50
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.41 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");
#define cin fin
#define cout fout

int n, k;
int saltele[16000];

int calcMin() {
    int x = saltele[0];
    for (int i = 1; i < n; i++) {
        if (saltele[i] > x) {
            x = saltele[i];
        }
    }
    return x;
}

int calcMax() {
    long long int x = saltele[0];
    for (int i = 1; i < n; i++) {
        x += saltele[i];
    }
    if (x > 16000) return 16000;
    return x;
}

int main() {
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> saltele[i];
    }

    int minC = calcMin();
    int maxC = calcMax();

    int elem;

    while (minC <= maxC) {
        int mijloc = (minC + maxC) / 2;

        int wagon = 0;
        int cap = 0;

        bool fail = false;
        for (int i = 0; i < n; i++) {
            if (cap + saltele[i] <= mijloc) {
                cap += saltele[i];
            } else {
                wagon++;
                if (wagon == k) {
                    fail = true;
                    break;
                }
                cap = saltele[i];
            }
        }

        if (fail) {
            minC = mijloc + 1;
            continue;
        } else {
            maxC = mijloc - 1;
            elem = mijloc;
        }
    }
    cout << elem << '\n';

    return 0;
}