Pagini recente » Cod sursa (job #2597277) | Borderou de evaluare (job #2793187) | Borderou de evaluare (job #2243257) | Rezultatele filtrării | Cod sursa (job #550009)
Cod sursa(job #550009)
#include<fstream.h>
ifstream f("fis.in");
ofstream g("fis.out");
int sum[6000001], sm,min1, best ;
int i,n,p,u;
int main(){
f>>n;
for(i=1;i<=n;i++){
f>>sum[i];
sum[i]=sum[i]+sum[i-1];
}
sm=-(1<<32);
for(i=1;i<=n;++i){
best=sum[i]-min1;
if(min1>sum[i]){
min1=sum[i];
p=1;
}
if(sm<best){
sm=best;
u=i;
}
}
g<<sm<<" "<<p<<" "<<u<<'\n';
g.close();
return 0;
}