Cod sursa(job #2246090)
Utilizator | Data | 26 septembrie 2018 17:24:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,s,smax=0,x,z;
long long a[6000050];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=n;j++)
{
s=s+a[j];
if(s>smax)
{
smax=s;
x=i;
z=j;
}
}
}
fout<<smax<<" "<<x<<" "<<z;
return 0;
}