Cod sursa(job #2191038)
| Utilizator | Data | 1 aprilie 2018 13:48:35 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,i,j,s[6000005],temp,nrmax,a,b;
int main()
{
fin >> n;
for (i=1;i<=n;i++)
{
fin >>temp;
s[i]=s[i-1]+temp;
for (j=1;j<=i;j++)
{
temp=s[i]-s[j];
if (temp>nrmax){nrmax=temp;a=i;b=j;}
}
}
fout<<nrmax<<" "<<b+1<<" "<<a;
return 0;
}
