Cod sursa(job #1832689)
Utilizator | Data | 20 decembrie 2016 18:53:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int v[6000001];
int main()
{
int n,i,maxx=-999999999,aj,ai,aim;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
int s=0;
for(i=1;i<=n;i++)
{
s+=v[i];
if(s<0)
{
ai=i+1;
s=0;
}
if(s>maxx) {maxx=s;aim=ai;aj=i;}
}
cout<<maxx<<" "<<aim<<" "<<aj;
return 0;
}