Cod sursa(job #2002111)
Utilizator | Data | 18 iulie 2017 18:06:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long int a[100];
int main()
{
int i,j,n;
ifstream ci("ssm.in"); ofstream cou("ssm.out");
int sum=0,maxi,imax,jmax;
maxi=sum;
ci>>n;
for(i=1;i<=n;i++)
ci>>a[i];
for(i=1;i<=n;i++)
{
for(j=i;j<=n;j++)
{sum+=a[j];
if(sum>maxi)
{maxi=sum; imax=i;jmax=j;}
}
sum=0;
}
cou<<maxi<<" "<<imax<<" "<<jmax;
return 0;
}