Cod sursa(job #2369010)
Utilizator | Nuna David SpatialART | Data | 5 martie 2019 20:38:13 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N,v[6000005],dp[6000005];
int start,stop,best_s=-int(2e9),S=0;
int main()
{
f>>N;
for(int i=1; i<=N; i++)
{
f>>v[i];
dp[i]=max(dp[i-1]+v[i],v[i]);
//cout<<dp[i]<<" ";
if(dp[i]>=0)
{
S=dp[i];
if(dp[i]>best_s)
{
best_s=dp[i];
stop=i;
}
}
else if(dp[i]<0)
start=i+1;
}
g<<best_s<<" "<<start<<" "<<stop;
}