Cod sursa(job #1782911)
Utilizator | Data | 18 octombrie 2016 17:09:33 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long s[6000000],v[6000000];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,maxi=-100000000,poz1,poz2,s=0;
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i];
s+=v[i];
if(maxi<s)
{
maxi=s;
poz2=i;
}
if(s<0)
{
s=0;
poz1=i+1;
}
}
cout<<maxi<<" "<<poz1<<" "<<poz2;
return 0;
}