Cod sursa(job #1588800)
Utilizator | Manolache Stefan StefanManolache | Data | 3 februarie 2016 17:03:07 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000000];
int main()
{
int n,i,maxs,is;
in >> n;
for(i=0;i<n;i++)
in >> v[i];
maxs=v[0];
for(i=1;i<n;i++)
{
if(v[i-1]>=0)
v[i]=v[i-1]+v[i];
if(maxs<v[i])
{
maxs=v[i];
is=i;
}
}
i=is;
is++;
while(v[i]>0&&i>=0)
i--;
if(i==0)
i++;
else
i=i+2;
out << maxs << " " << i << " " << is;
return 0;
}