Cod sursa(job #2626266)
Utilizator | Iani Maria maria.iani | Data | 6 iunie 2020 12:57:22 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.85 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int N,K,dr=0,st=0,mij,i,v[16001],rez=25000000;
int main()
{
f>>N>>K;
for (i=0;i<N;i++)
{
f>>v[i];
dr+=v[i];
if (v[i]>st)
{ st=v[i];}
}
cout<<st<<" "<<dr;
while (st<=dr)
{
mij=(st+dr)/2;
long long S=0, nr=0;
for (i=0;i<N;i++)
{
S+=v[i];
if (S>mij)
{
nr++;
S=v[i];
}
}
if (S!=0)
nr++;
if (nr<=K)
{
if(mij<rez)
rez=mij;
dr=mij-1;
cout<<1;
}
else
{st=mij+1;
cout<<2; }
}
g<<rez;
}