Pagini recente » Cod sursa (job #1370874) | Cod sursa (job #614515) | Cod sursa (job #3179466) | Cod sursa (job #2495892) | Cod sursa (job #549993)
Cod sursa(job #549993)
#include<fstream.h>
ifstream f("fis.in");
ofstream g("fis.out");
int v[6000001], sum[6000001], sm,p,u,min1, best[6000001] ,i,n;
int main(){
f>>n;
for(i=1;i<=n;i++){
f>>v[i];
sum[i]=v[i]+sum[i-1];
}
sm=-(1<<32);
for(i=1;i<=n;++i){
best[i]=sum[i]-min1;
if(min1>sum[i]){
min1=sum[i];
p=1;
}
if(sm<best[i]){
sm=best[i];
u=i;
}
}
g<<sm<<" "<<p<<" "<<u<<'\n';
g.close();
return 0;
}