Cod sursa(job #1611985)
Utilizator | Data | 24 februarie 2016 17:12:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long n,i,s[1000000],j,mx=0,mn,ls,pmin,pmax;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>s[i];
s[i]+=s[i-1];
}
mn=0;
for(i=1;i<=n;i++)
{
if(s[i]-mn > mx)
{
mx=s[i]-mn;pmax=i;ls=pmin+1;
}
if(s[i]<mn)
{
mn=s[i];
pmin=i;
}
}
g<<mx<<' '<<ls<<' '<<pmax;
}