Mai intai trebuie sa te autentifici.
Cod sursa(job #2272155)
| Utilizator | Data | 29 octombrie 2018 19:13:45 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.82 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
const int L=28, N=16001;
int n, v[N];
bool SePoate(int c, int k)//verif daca toate cele n saltele pot fi transportate in cel mult k camioane de capacitate c
{
int nrtrans=1, cap=c;
for(int i=1;i<=n;i++)
{
if(v[i]>cap)
{
nrtrans++;
cap=c;
}
if(v[i]>cap) return false;
cap-=v[i];
}
return (nrtrans<=k);
}
int CautBin(int k)
{
int r = 0, pas = 1<<L;
while(pas!=0)
{
if(!SePoate(r+pas, k))
{
r+=pas;
}
pas/=2;
}
return r+1;
}
int main()
{
int k;
in >> n >> k;
for(int i=1;i<=n;i++)
{
in >> v[i];
}
out << CautBin(k);
return 0;
}
