Cod sursa(job #1831494)
| Utilizator | Data | 18 decembrie 2016 11:05:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <climits>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s,i,n,sMax,nr,uMax,nrMax,Max1,Max2,x,v[6000001];
int main()
{
fin>>n;
s=0;
x=1;
sMax=INT_MIN;
for(i=1;i<=n;i++){
fin>>v[i];
s=s+v[i];
if(s>sMax){
sMax=s;
Max1=i;
Max2=x;
}
if(s<0)
{
s=0;
x=i+1;
}
}
fout<<sMax<<" "<<Max2<<" "<<Max1;
return 0;
}
