Cod sursa(job #2355231)
Utilizator | Data | 25 februarie 2019 21:54:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[7000005],n,i,sol=-2000000000,s=0,in,sf,ind;;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
if(s<0)
{
s=v[i];
ind=i;
}
else
s+=v[i];
if(sol<s)
{
sol=s;
in=ind;
sf=i;
}
}
g<<sol<<" "<<in<<" "<<sf;
}