Cod sursa(job #1717833)
Utilizator | Data | 15 iunie 2016 21:33:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
int n,v[6000003],s[6000003],i,sol;
long long minim,maxim,pmax,jmax;
int main(){
fin>>n;
s[0]=0;
minim=6000000;
maxim=-6000000;
for(i=1;i<=n;i++){
fin>>v[i];
s[i]=s[i-1]+v[i];
if(s[i]<=minim){
minim=s[i];
sol=i;
}
if(s[i]!=minim){
if(s[i]-minim>=maxim){
maxim=s[i]-minim;
pmax=sol;
jmax=i;
}
}
}
fout<<maxim<<" "<<pmax+1<<" "<<jmax;
return 0;
}