Cod sursa(job #2024210)
Utilizator | Data | 20 septembrie 2017 09:38:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v[6000001];
int main()
{int N,i,max,t,k,c,s,min;
fin>>N;
max=INT_MIN;
min=INT_MAX;
s=0;
t=1;
for(i=1;i<=N;i++){
fin>>v[i];
s=s+v[i];
if (s<min){
min=s;
t=i+1;}
if (max<s-min){
max=s-min;
c=i;}}
fout<<max<<" "<<t<<" "<<c;
return 0;
}