Cod sursa(job #2480185)
Utilizator | Data | 25 octombrie 2019 01:03:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int t,a,j,i,n,m,k,z,l,c,maxim,x,y,k2,k1,s;
int main()
{ maxim=-1000000000;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a;
if(s+a>a)
{
s+=a;
k2=i;
}
else
{
s=a;
k1=i;k2=i;
}
if(s>maxim)
{
x=k1;
y=k2;
maxim=s;
}
}
fout<<maxim<<" "<<x<<" "<<y;
return 0;
}