Cod sursa(job #1925453)
| Utilizator | Data | 13 martie 2017 11:08:43 | |
|---|---|---|---|
| Problema | Transport | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <cstdio>
using namespace std;
int v[16005];
int n,k;
bool verif(int x)
{
int j=0;
for(int i=1;i<=k;++i)
{
int s=v[j];
while(s<=x){
s+=v[++j];
if(j==n)
return 1;
}
}
return 0;
}
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int rez,pas;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;++i)
{
scanf("%d",&v[i]);
}
pas=1<<28;
rez=1<<28;
while(pas>0)
{
if(verif(rez-pas))
rez-=pas;
pas/=2;
}
printf("%d",rez);
return 0;
}
