Cod sursa(job #1433550)
Utilizator | Data | 9 mai 2015 15:46:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 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=0,f,kk,max;
max=-1000000;
fin>>n;
s=0;
for(i=0;i<n;i++)
{
fin>>v[i];
s+=v[i];
if(s>max) {
max=s;
f=i;
kk=k;
}
if(s<0)
{
s=0;
k=i+1;
}
}
fout<<max << " ";
fout<<kk + 1 << " ";
fout<<f + 1;
return 0;
}