Cod sursa(job #1251444)
Utilizator | Data | 29 octombrie 2014 14:55:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int poz,i,n,smax,sc,x,y,j,a[6000000];
int main()
{
f>>n;
for (i=1;i<=n;i++) f>>a[i];
sc=smax=a[1];
poz=x=y=1;
for (i=2;i<=n;i++)
{
if (sc<0)
{
sc=a[i];
poz=i;
}
else sc=sc+a[i];
if (sc>smax)
{
smax=sc;
x=poz;
y=i;
}
}
g<<smax<<" "<<x<<" "<<y;
return 0;
}