Pagini recente » Cod sursa (job #546341) | Cod sursa (job #152773) | Cod sursa (job #512368) | Cod sursa (job #1104957) | Cod sursa (job #2705563)
#include <bits/stdc++.h>
#define N 808
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k;
int v[N];
int s[N];
void Citire()
{
int i;
fin >> n >> k;
for( i=1; i<=n; i++ )
fin >> v[i];
for( i=1; i<=n; i++ )
s[i] = s[i-1] + v[i];
}
bool check( int x )
{
int i;
int ct = 1;
int V = 0;
for( i=1; i<=n; i++ )
{
V += v[i];
if( V > x ) V = v[i], ct++;
}
if( ct <= k ) return 1;
else return 0;
}
int CautareBinara()
{
int st, dr;
int mij;
int poz = -1;
st = s[1]; dr = s[n];
while( st <= dr )
{
mij = ( st + dr ) / 2;
if( check( mij ) )
{
dr = mij - 1;
poz = mij;
}
else
{
st = mij + 1;
}
}
return poz;
}
void Rezolvare()
{
int i, k;
fout << CautareBinara();
}
int main()
{
Citire();
Rezolvare();
fin.close();
fout.close();
return 0;
}