Cod sursa(job #2064324)
Utilizator | Data | 12 noiembrie 2017 10:32:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,p1,p2,k1,k2,s,smax,x,i;
int main()
{
f>>n>>s;
p1=1;
p2=1;
for(i=2;i<=n;i++)
{
f>>x;
if(smax<s)
{
smax=s;
k1=p1;
k2=p2;
}
if(s+x>=0)
{
s+=x;
p2=i;
}
else
{
s=x;
p1=i;
p2=i;
}
}
if(smax<s)
{
smax=s;
k1=p1;
k2=p2;
}
g<<smax<<" "<<k1<<" "<<k2;
return 0;
}