Cod sursa(job #1588828)
| Utilizator | Data | 3 februarie 2016 17:16:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 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=1;i<n+1;i++)
in >> v[i];
maxs=v[1];
is=1;
for(i=2;i<n+1;i++)
{
if(v[i-1]>=0)
v[i]=v[i-1]+v[i];
if(maxs<v[i])
{
maxs=v[i];
is=i;
}
}
i=is;
while(v[i]>=0&&i>0)
i--;
i++;
out << maxs << " " << i << " " << is;
return 0;
}
