Cod sursa(job #1976497)
| Utilizator | Data | 3 mai 2017 15:59:10 | |
|---|---|---|---|
| Problema | Transport | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
using namespace std;
int n,k,m,s,v[16007];
int main()
{
ifstream fin("transport.in");
ofstream fout("transport.out");
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>v[i];
if(v[i]>m)m=v[i];
s=s+v[i];
}
fout<<m<<" "<<s<<"\n";
for(int i=m;i<=s;++i)
{
int candidat=i;
int cnt=0,sum=0;
for(int j=1;j<=n;++j)
{
if(sum+v[j]>candidat)
{
cnt++;
sum=v[j];
continue;
}
sum+=v[j];
}
if(sum!=0)++cnt;
if(cnt>k) continue;
fout<<candidat<<"\n";
break;
}
return 0;
}
