Cod sursa(job #1783588)
Utilizator | Data | 19 octombrie 2016 09:48:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 75 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long v;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,maxi=-int(2e9),poz1=1,poz2=1,s=0,poz3=1;
f>>n;
for(int i=1;i<=n;i++)
{
f>>v;
s+=v;
if(maxi<s)
{
maxi=s;
poz3=poz1;
poz2=i;
}
if(s<0)
{
s=0;//v[i];
poz1=i+1;
}
}
g<<maxi<<" "<<poz3<<" "<<poz2;
return 0;
}