Pagini recente » Cod sursa (job #2956776) | Cod sursa (job #2631796) | Cod sursa (job #2719104) | Cod sursa (job #1194531) | Cod sursa (job #2884543)
/*
"TLE is like the wind, always by my side"
- Yasuo - 2022 -
*/
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001],n,i,k,inaltime,drum,s,mx,j;
/*
1 - dreapta
2 - jos
3 - stinga
4 - sus
*/
bool corect(int a)
{
s=0;
drum=0;
for (j=1;j<=n;j++)
{
s+=v[j];
if (s>a)
{
drum++;
s=v[j];
}
}
drum++;
if (drum<=k)
return 1;
else
return 0;
}
int main()
{
fin >> n >> k;
for (i=1; i<=n; i++)
{
fin >> v[i];
if (v[i]>mx)
mx=v[i];
}
int r=0, pas=(1<<30);
while(pas)
{
if(!corect(r+pas))
r+=pas;
pas/=2;
}
fout <<r+1;
}