Cod sursa(job #2054805)
Utilizator | Data | 2 noiembrie 2017 16:10:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000005],i,j,d,dm,m,s,o,u;
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>m;
s+=m;
v[i]=s;
}
for (i=1;i<=n;i++)
{
for (j=i+1;j<=n;j++)
{
d=v[j]-v[i];
if (d>dm)
{
dm=d;
o=i;
u=j;
}
}
}
fout<<dm<<" "<<o+1<<" "<<u;;
return 0;
}