Cod sursa(job #2686409)
| Utilizator | Data | 19 decembrie 2020 09:38:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, v[1001], dp[1001], i, in, sf, sm, im;
int main()
{
cin>>n;
for(i=1; i<=n; i++) cin>>v[i];
dp[1]=v[1];
in=1;
for(i=2; i<=n; i++)
{
if(dp[i-1]<=0)
{
dp[i]=v[i];
in=i;
sm=dp[i];
}
else
{
dp[i]=v[i]+dp[i-1];
}
if(dp[i]>sm)
{
sm=dp[i];
sf=i;
im=in;
}
}
cout<<sm<<" "<<im<<" "<<sf;
return 0;
}
