Cod sursa(job #852061)
| Utilizator | Data | 10 ianuarie 2013 20:16:10 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
long long int a[6000003],i,n,pc,sc,max1,ic,sf,y,k,miny;
int main ()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
max1=-10000000;
sc=-1;
ic=0;sf=0;pc=0;
for(i=1;i<=n;i++)
{if(sc>0) sc=sc+a[i];
else{sc=a[i]; pc=i;}
if(sc>max1) {max1=sc; ic=pc;sf=i;}
}
g<<max1<<" "<<ic<<" "<<sf;
return 0;
}
