Nu aveti permisiuni pentru a descarca fisierul grader_test9.ok
Cod sursa(job #1195451)
Utilizator | Data | 7 iunie 2014 12:18:47 | |
---|---|---|---|
Problema | Transport | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.08 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int a[16005],n,k,sum,maxx;
void citire()
{
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>a[i];
sum+=a[i];maxx=max(maxx,a[i]);
}
}
int solve(int m)
{
int av=0,cont=1;
for(int i=1;i<=n;i++)
{
if(a[i]+av<=m)
{
av+=a[i];
}
else {cont ++; av=a[i];}
// cout<<a[i]<<" "<<cont<<"\n";
}
if(cont<k) return 1;
if(cont==k) return 2;
if(cont>k) return 3;
}
void binara()
{
int aux,o,li=maxx,lf=sum;
while(li<lf)
{
aux=(li+lf)/2;
// cout<<aux<<"\n";
o=solve(aux);
if(o==2) {break;}
if(o==1) {lf=aux;}
if(o==3) {li=aux;}
}
int sol=aux;
for(int i=aux-1;i>=maxx;i--)
{
//cout<<i<<"\n";
o=solve(i);
// cout<<"\n";
if(o==2) {sol=i;} else break;
}
g<<sol;
}
int main()
{
citire();
binara();
return 0;
}