Cod sursa(job #1583776)
| Utilizator | Data | 29 ianuarie 2016 12:46:42 | |
|---|---|---|---|
| Problema | Transport | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16005];
int main()
{
int i,s=0,maxim=16001,n,st,dr,mij,s1=0,k,j;
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i];
for(j=1;j<=16001;j++)
{ s1=1; s=0;
for(i=1;i<=n;i++) { if(v[i]>j)
{s1=160001;break;} if(s+v[i]<=j) s+=v[i]; else s1++,s=v[i]; }
if(s1<=k) break;
}
g<<j;
f.close();
g.close();
return 0;
}
