Cod sursa(job #2062469)
Utilizator | Data | 10 noiembrie 2017 14:47:46 | |
---|---|---|---|
Problema | Transport | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v1[16001];
int main()
{
int n,k,i,maxim=0,s=0,st,dr,mij,cnt=0,ok=1;
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v1[i];
s+=v1[i];
if(v1[i]>maxim)
maxim=v1[i];
}
st=maxim;
dr=s;
int j=0,o=0;
j=1;
s=0;
while(st<=dr)
{
cnt=0;
mij=(st+dr)/2;
while(j<=n)
{
if(s+v1[j]<=mij)
{
s+=v1[j];
j++;
}
else
{
cnt++;
s=0;
}
}
j=1;
if(cnt>k)
{
st=mij+1;
}
else
{
o=mij;
dr=mij-1;
}
}
out<<o;
return 0;
}