Cod sursa(job #2476886)
Utilizator | Data | 19 octombrie 2019 12:08:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n, v[100],s[100],mn[601],maxi,r[601],i;
int main()
{
ifstream f ("ssm.in");
ofstream g ("ssm.out");
f>>n;
f>>v;
dp=v;
mx=dp;
last=dp;
r=1;
for (i=2;i<=n;i++)
{
f>>v;
dp=max(v,last+v);
if (mx<dp)
{
mx=dp;
r=i;
if (v>last+v)
{
l=i-1;
}
}
last=dp;
}
g<<mx<<" "<<l+1<<" "<<r;
return 0;
}