Cod sursa(job #849650)
| Utilizator | Data | 7 ianuarie 2013 14:36:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 75 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include<fstream>
using namespace std;
long long i,n,max1,sc,ic,pc,sf,a[6000000];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sc=a[1];
ic=1;
pc=1;
sf=1;
max1=a[i];
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;
}
}
sc=0;
for(i=ic;i<=sf;i++)
sc=sc+a[i];
g<<sc<<" "<<ic<<" "<<sf;
}
