Cod sursa(job #2133544)
Utilizator | Data | 17 februarie 2018 09:13:08 | |
---|---|---|---|
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 i,n,p,x,y,sc,smax,a[6000005];
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>a[i];
sc=a[1];
smax=a[1];
for(i=2;i<=n;++i)
{
if(sc<0)
{
sc=a[i];
p=i;
}
else sc+=a[i];
if(sc>smax)
{
smax=sc;
x=p;
y=i;
}
}
g<<smax<<" "<<x<<" "<<y<<'\n';
return 0;
}