Cod sursa(job #1496228)
Utilizator | Data | 4 octombrie 2015 16:59:49 | |
---|---|---|---|
Problema | Transport | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include<stdio.h>
int v[16002];
int main(){
int n,k,i,nr,max,a,s,j;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
s=0;
for(i=1;i<=n;i++){
scanf("%d",&a);
s=s+a;
v[i]=a;
}
i=1;
max=-1;
nr=0;
while(k!=1){
s=s-v[i];
nr=v[i]+nr;
if((s%3+s/3)<nr){
k--;
if(nr>max)
max=nr;
nr=0;
}
i++;
}
nr=0;
for(j=i;j<=n;j++)
nr+=v[j];
if(max<nr)
max=nr;
printf("%d",max);
return 0;
}