Mai intai trebuie sa te autentifici.
Cod sursa(job #2659225)
Utilizator | Data | 16 octombrie 2020 10:08:16 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.92 kb |
#include <fstream>
using namespace std;
const int NMAX=16000;
int v[NMAX+5];
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k;
bool ok(int cap)
{
int tr,sc,i;
sc=0;
tr=0;
for(i=1;i<=n;i++)
{
if(v[i]>cap) return 0;
if(sc+v[i]<=cap)
sc=sc+v[i];
else
{
tr++;
sc=v[i];
}
}
int bs_left(int st,int dr)
{
int med,last=-1;
while(st<=dr)
{
med=(st+dr)/2;
if(ok(med))
{
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
}
int main()
{
int i,s;
fin>>n>>k;
s=0;
for(i=1;i<=n;i++)
{
fin>>v[i];
s=s+v[i];
}
fout>>bsl(i,s);
fin.close();
fout,close();
return 0;
}