Cod sursa(job #1791234)
Utilizator | Data | 29 octombrie 2016 11:00:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,i,scMax,sc,a[6000010],p,x,y;
int main()
{
f>>n;
scMax=a[1];
x=p=y=0;
for(i=1; i<=n; i++) f>>a[i];
sc=a[1];
for(i=2; i<=n; i++)
{
sc+=a[i];
if(sc<a[i])
{
sc=a[i];
p=i;
}
if(sc>scMax)
{
scMax=sc;
x=p;
y=i;
}
}
g<<scMax<<" "<<x<<" "<<y;
return 0;
}