Pagini recente » Cod sursa (job #1756993) | Cod sursa (job #2871948) | Cod sursa (job #1036988) | Cod sursa (job #2884707) | Cod sursa (job #240352)
Cod sursa(job #240352)
#include<fstream.h>
int a[16000];
long max,i,n,k,y,s,min;
ifstream f("transport.in");
ofstream g("transport.out");
int main(){
f>>n>>k;
max=0;
for(i=1;i<=n;i++){
f>>a[i];
if(a[i]>max)
max=a[i];
s=s+a[i];}
if(s/k+s%k>max)
max=s/k+s%k;
s=0;
min=0;
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s>max){
s=s-a[i];
y=s;s=a[i];
if(y>min){
min=y;}
}
}
if(s>min)
min=s;
g<<min;
f.close();
g.close();
return 0;}