Cod sursa(job #2118311)
Utilizator | Data | 30 ianuarie 2018 14:43:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,a[12],p,x,y,smax,sc;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=2;i<=n;i++)
{
if(sc>0) sc=sc+a[i];
else
{
sc=a[i];
p=i;
}
if(sc>smax)
{
smax=sc;
x=p;
y=i;
}
}
g<<smax<<" "<<x<<" "<<y;
return 0;
}