Cod sursa(job #1077779)
Utilizator | Data | 11 ianuarie 2014 17:30:53 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("transport.in");
int n, k,v[100],max=0;
fin>>n>>k;
for(int i=0; i<n; i++)
{
fin>>v[i];
if(max < v[i]) max=v[i];
}
int ok=0;
while(ok==0)
{
int c=0, s=0;
for(int i=0; i<n; i++)
{
s+=v[i];
if(s>=max)
{
c++;
s=v[i];
}
}
if(c==k) ok=1;
else max++;
}
ofstream fout("transport.out");
fout<<max;
fin.close();
fout.close();
return 0;
}