Cod sursa(job #2002654)
Utilizator | Alexandrescu Diana AlexDiana | Data | 20 iulie 2017 15:24:57 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <limits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001];
int main()
{
int a,amax,bmax,smax,s,n;
in>>n;
for(int i=0;i<n;i++)
in>>v[i];
a=amax=0;
s=0;
smax=numeric_limits<int>::min();
for(int i=0;i<n;i++)
{
s+=v[i];
if(s<v[i])
{
s=v[i];
a=i;
}
if(s>smax)
{
smax=s;
amax=a+1;
bmax=i+1;
}
}
out<<smax<<" "<<amax<<" "<<bmax;
return 0;
}