Cod sursa(job #1791250)
Utilizator | Data | 29 octombrie 2016 11:10:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
int n,a[10000000],sc,sm,x,y,p,i;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
sc=a[1];
sm=a[1];
p=x=y=0;
for(i=2; i<=n; i++)
{
if(a[i]+sc<=a[i])
{
sc=a[i];
p=i;
}
else
sc+=a[i];
if(sc>sm)
{
sm=sc;
x=i;
y=p;
}
}
g<<sm<<" "<<y<<" "<<x;
return 0;
}