Cod sursa(job #1070773)
Utilizator | Data | 1 ianuarie 2014 22:56:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, v[1001], i, sum[1001], Max=-1, inc, sf, nre;
int main()
{
f>>n;
for (i=1; i<=n; i++)
f>>v[i];
for (i=1; i<=n; i++)
{
sum[i]=max(v[i], sum[i-1]+v[i]);
nre++;
if (sum[i]==v[i])
nre=1;
if (Max < sum[i])
{
Max = sum[i];
inc=i-nre+1;
sf=i;
}
}
g<<Max<<" "<<inc<<" "<<sf;
return 0;
}