Cod sursa(job #1939023)
Utilizator | Data | 25 martie 2017 13:24:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000000],s[6000000];
int main(){
int i,j,n,M=-99999999999,x,y,m1,k,min1=0;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(j=1;j<=n;j++){
s[j]=s[j-1]+v[j];
if(min1>s[j-1]){
min1=s[j-1];
x=j;}
m1=M;
M=max(s[j]-min1,M);
if(m1!=M)
y=j;
}
fout<<M<<" "<<x<<" "<<y;
}