Pagini recente » Cod sursa (job #2644702) | Cod sursa (job #849696) | Cod sursa (job #2677363) | Cod sursa (job #1469977) | Cod sursa (job #1711635)
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,v[16001],s[16001],k;
bool verif(int l)
{
int i,p=0,q=0;
for(i=1;i<=n;i++)
{
if(v[i]>l)
return false;
if(v[i]>p)
{
q++;
p=l;
}
p-=v[i];
}
if(q<=k)
return true;
return false;
}
int src()
{
int pas=1<<28,i=0;
while(pas)
{
if(!verif(i+pas))
i+=pas;
pas/=2;
}
return i+1;
}
int main()
{
int i;
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
g<<src();
return 0;
}