Cod sursa(job #1240110)
| Utilizator | Data | 10 octombrie 2014 15:46:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long n,i,scmax,sc,x,y,p,a[6000001];
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
sc=scmax=a[1];
p=x=y=1;
for(i=2;i<=n;i++)
{
if(sc>=0) sc+=a[i];
else
{
sc=a[i];
p=i;
}
if(sc>scmax)
{
scmax=sc;
x=p;
y=i;
}
}
g<<scmax<<" "<<x<<" "<<y;
return 0;
}
