Cod sursa(job #531318)
Utilizator | Data | 9 februarie 2011 14:02:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream.h>
int a , i , j , V[6000001] , sum , max , b , c;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>a;
for(i=1;i<=a;i++){
f>>V[i];
}
for(i=1;i<=a;i++){
sum=0;
for(j=i;j<=a;j++){
sum+=V[j];
if(sum>max){
max=sum;
b=i;c=j;
}
}
}
g<<max<<" "<<b<<" "<<c;
f.close();
g.close();
return 0;
}