Mai intai trebuie sa te autentifici.
Cod sursa(job #2146055)
| Utilizator | Data | 27 februarie 2018 19:24:45 | |
|---|---|---|---|
| Problema | Transport | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.86 kb |
#include <bits/stdc++.h>
using namespace std;
int n, k, a[16005],salmax,cammax;
void Citire()
{
ifstream in ("transport.in");
int i ;
in >> n >> k;
for ( i = 1 ; i <= n ; i++)
{
in>>a[i];
if(salmax<a[i])
salmax=a[i];
cammax+=a[i];
}
in.close();
}
bool OK (int c)
{
int i, sal, nrdr=0;
for( i=1 ; i <=n ;)
{
sal=0;
while(sal+a[i] <= c)
{
sal+=a[i];
i++;
}
nrdr++;
}
return nrdr<=k;
}
int main()
{
ofstream fout ("transport.out");
int camion;//capacitatea unui camion
Citire();
for(camion=salmax; camion <= cammax ;camion++)
if(OK(camion)==true)
{
fout<<camion<<"\n";
return 0;
}
fout.close();
return 0;
}
