Cod sursa(job #1551669)
Utilizator | Data | 16 decembrie 2015 11:29:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{int i,n,a,dr=1,st=1,s1=0,d1=0;long long smax=-3000000,s;
f>>n;
s=0;
for(i=1;i<=n;i++)
{
f>>a;
if(s+a>a)
{
s=s+a;
dr++;
}
else
{
s=a;
st=dr=i;
}
if(s>smax)
{
smax=s;
d1=dr;
s1=st;
}
}
g<<smax<<" "<<s1<<" "<<d1;
f.close();
g.close();
return 0;
}