Cod sursa(job #2826333)
Utilizator | Data | 5 ianuarie 2022 11:38:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,i,v[6000005],x,b[6000005],mx=-2147483648,j;
int main()
{
cin>>n;
cin>>x;
v[1]=x;
for(i=2; i<=n; i++)
{
cin>>x;
v[i]=max(v[i-1]+x,x);
if(v[i]==v[i-1]+x) b[i]=b[i-1];
else b[i]=i;
if(v[i]>mx)
{
mx=v[i];
j=i;
}
}
cout<<v[j]<<" "<<b[j]<<" "<<j;
return 0;
}