Cod sursa(job #1575595)
| Utilizator | Data | 21 ianuarie 2016 17:50:14 | |
|---|---|---|---|
| Problema | Transport | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.78 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,a[16005],max1,s,stg,dr,mijloc,suma,nr,i;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>a[i];
if(a[i]>max1)
max1=a[i];
s+=a[i];
}
stg=max1;
dr=s;
while(stg<=dr)
{
nr=1;
mijloc=(stg+dr)/2;
for(i=1;i<=n;i++)
{
suma+=a[i];
if(suma>mijloc)
{
suma=a[i];
nr++;
}
}
if(suma<=mijloc)
{
if(nr>k)
stg=mijloc+1;
else
dr=mijloc-1;
suma=0;
}
}
g<<stg;
return 0;
}
