Cod sursa(job #262886)
Utilizator | MciprianM MciprianM | Data | 19 februarie 2009 18:44:55 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int main(){
int i, max=0, sum, n,x, i1, i2,r1,r2;
ifstream f("ssm.in");
f>>n;
f>>sum;i1=1;i2=1;
for(i=2;i<=n;i++){
f>>x;
if(sum+x>=0) sum+=x, i2++;
else sum=0,i1=i+1,i2=i;
if(max<sum){ max=sum;r1=i1,r2=i2;}
}
f.close();
ofstream g("ssm.out");
g<<max<<' '<<r1<<' '<<r2<<'\n';
g.close();
return 0;
}