Cod sursa(job #2000595)
Utilizator | Andrei Feodorov Nashik | Data | 14 iulie 2017 11:09:23 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
//#include <iostream>
#include <fstream>
using namespace std;
int v[6000005];
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int n,i,maxim=-1,inc,sf;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
int minim=0,suma=0;
for(i=1;i<=n;i++)
{
suma+=v[i];
if(maxim<suma-minim)
{
maxim=suma-minim;
sf=i;
}
if(suma<minim)
{
minim=suma;
inc=i+1;
}
}
cout<<maxim<<" "<<inc<<" "<<sf;
return 0;
}