Cod sursa(job #2044657)
Utilizator | Data | 21 octombrie 2017 11:46:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("ssm.in");
ofstream out ("ssm.out");
int n,i,j,v[1500],m,x,im,ima,s=0,ma,mi;
int main()
{
ma=0;
mi=99999;
in>>n;
for(i=1;i<=n;i++)
{in>>x;
s=s+x;
cout<<s<<" ";
if(s<mi){mi=s;im=i;}
if(s>ma){ma=s;ima=i;}
}
out<<ma-mi<<" ";
out<<im+1<<" "<<ima;
return 0;
}