Cod sursa(job #1433097)
Utilizator | Data | 9 mai 2015 14:55:23 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000000];
int main()
{
int n,i,s,k,f,max;
max=-10000;
fin>>n;
s=0;
for(i=0;i<n;i++)
{
fin>>v[i];
if(s>max)
max=s;
if(s>0)
{
s=s+v[i];
f=i;
}
else
{
s=v[i];
k=i+1;
}
}
fout<<max<<" "<<" "<<k<<" "<<f;
return 0;
}