Cod sursa(job #1154651)
Utilizator | Data | 26 martie 2014 12:00:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000001],i,j,Max,jj,ii,x;
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>x;
v[i]=v[i-1]+x;
}
for (i=1;i<=n;i++)
{
for (j=1;j<i;j++)
{
if (v[i]-v[j]>Max)
{
Max=v[i]-v[j];
ii=i;
jj=j;
}
}
}
fout<<Max<<" "<<jj+1<<" "<<ii;
return 0;
}