Cod sursa(job #2377888)
Utilizator | Nuna David SpatialART | Data | 11 martie 2019 13:32:36 |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int N,K,V[16005];
int sol;
int st=1,dr=16000,mid;
int isgood(int D)
{
int S=0,nr=0;
for(int i=1;i<=N;i++)
{
S+=V[i];
if(S>D or i==N)
{
S=V[i];
nr++;
}
}
return nr;
}
int main()
{
f>>N>>K;
for(int i=1;i<=N;i++)
f>>V[i];
while(st<=dr)
{
mid=(st+dr)/2;
if(isgood(mid)==K)
{
sol=mid;
st=mid+1;
}
else
dr=mid-1;
}
g<<sol;
}