Mai intai trebuie sa te autentifici.
Cod sursa(job #2683881)
| Utilizator | Data | 12 decembrie 2020 10:51:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, v[1001], dp[1001], i, in, sf, sm, smx, inx, sfx;
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;
}
}
}
if(sm>smx) smx=sm, inx=in, sfx=sf-1;
cout<<smx<<" "<<inx<<" "<<sfx;
/*for(i=1; i<=n; i++)
cout<<dp[i]<<" ";*/
return 0;
}
