Cod sursa(job #1939050)
Utilizator | Data | 25 martie 2017 13:38:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000000];
int main(){
int j,n,M=-99999999999,x,y,min1=0,nr,z;
fin>>n;
for(j=1;j<=n;j++){
fin>>nr;
s[j]=s[j-1]+nr;
if(min1>s[j-1]){
min1=s[j-1];
x=j;}
if(s[j]-min1>M && j!=1){
M=s[j]-min1;
y=j;
z=x; }
}
fout<<M<<" "<<z<<" "<<y;
}