Cod sursa(job #1872982)
| Utilizator | Data | 8 februarie 2017 18:38:38 | |
|---|---|---|---|
| Problema | Transport | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int v[16005];
int main()
{
int i, n, k, t, su=0, mx=INT_MIN, s, d, m, a, e;
f>>n>>k;
for(i=1; i<=n; i++)
{
f>>v[i];
if(v[i]>mx)
mx=v[i];
su+=v[i];
}
d=s;
s=mx;
m=(s+d)/2;
while(s<d)
{
a=1;
e=0;
m=(s+d)/2;
for(i=1; i<=n; i++)
{
if(e+v[i]<=m)
{
e+=v[i];
}
else
{
e=v[i];
a++;
}
}
if(a>k)
{
s=m+1;
}
else
{
d=m-1;
}
}
g<<s;
return 0;
}
