Cod sursa(job #1047307)
Utilizator | Data | 4 decembrie 2013 10:52:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
long n,i,a[6000005],ic,pc,sf,sc,max1;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
max1=a[1];
sc=pc=sf=1;
for(i=2;i<=n;i++)
{
if(sc>0)
sc=sc+a[i];
else
{
sc=a[i];
pc=i;
}
if(sc>max1)
{
ic=pc;
sf=i;
max1=sc;
}
}
g<<max1<<" "<<ic<<" ";
g<<sf;
return 0;
}