Cod sursa(job #311922)
Utilizator | Data | 4 mai 2009 18:38:56 | |
---|---|---|---|
Problema | Transport | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<fstream.h>
int main()
{int i,in,n,k,nd,c,v[16001];
ifstream q("transport.in");
ofstream w("transport.out");
q>>n>>k;
nd=k+1;
int max=0;
for(i=1;i<=n;i++)
{q>>v[i];
if(max<v[i])
max=v[i];}
c=max;
while(nd>k)
{nd=0;
c++;
in=0;
for(i=1;i<=n;i++)
{if(in+v[i]<=c)
in=in+v[i];
else
{nd++;
in=0;
i--;}}
nd++;}
w<<c;
return 0;}