Cod sursa(job #2125095)
Utilizator | Data | 7 februarie 2018 22:57:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{ int i,n,a,ant=0,curent,Max=-2e9,i1,i2;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>a;
if (ant<0)
{
ant=a;
curent=i;
}
else ant=ant+a;
if (Max<ant)
{Max=ant;i1=curent;i2=i;}
}fout<<Max<<" "<<i1<<" "<<i2;
return 0;
}