Cod sursa(job #2157196)
Utilizator | Data | 9 martie 2018 13:06:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int v[6000005];
int main()
{
long long s,cma,ma=0;
int n,i,j,a,b;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=n;j++)
{
s+=v[j];
cma=ma;
ma=max(ma,s);
if(ma>cma)
{
a=i;
b=j;
}
}
}
cout<<ma<<" "<<a<<" "<<b;
return 0;
}