Cod sursa(job #1524306)
Utilizator | Data | 13 noiembrie 2015 21:07:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <cstdio>
#include <fstream>
using namespace std;
ifstream in ("ssm.in");
ofstream out("ssm.out");
int main()
{
int n,x;
in>>n;
int s1, s2,smax;
in>>s1;
smax=s2=s1;
int i=1,j=1;
for(int k=2; k<=n; k++){
in>>x;
s2=s1;
if(x>s1+x){
s1=x;
i=k;
}
else
s1=s1+x;
if(s1>smax){
smax=s1;
j=k;
}
}
out<<smax<<" "<<i<<" "<< j;
return 0;
}