Cod sursa(job #664532)
| Utilizator | Data | 20 ianuarie 2012 12:01:22 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int ma,n,i,ic,sf,sc,pc,a[6000005];
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for (i=1; i<=n; ++i)
f>>a[i];
ma=a[1]; sc=a[1]; ic=1; sf=1; pc=1;
for (i=2; i<=n; i++)
{
if (sc>=0) sc+=a[i];
else
{
sc=a[i];
pc=i;
}
if (sc>ma)
{
ic=pc;
sf=i;
ma=sc;
}
}
g<<ma<<' '<<ic<<' '<<sf<<'\n';
return 0;
}
