Cod sursa(job #1611995)
Utilizator | Data | 24 februarie 2016 17:19:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,s[6000005],j,mx=0,mn,p,ls,ld;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>s[i];
s[i]+=s[i-1];
}
mn=1000000000;
for(i=1;i<=n;i++)
if(s[i]>mx) {ld=i;mx=s[i];}
for(i=1;i<ld;i++)
if(s[i]<mn) {ls=i+1;mn=s[i];}
g<<mx-mn<<' '<<ls<<' '<<ld;
}