Cod sursa(job #2526774)
| Utilizator | Data | 19 ianuarie 2020 10:45:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n, v, dp[6000001], start, smax, poz, ind;
f>>n>>v;
dp[1]=v;
start=1;
smax=v;
ind=1;
poz=1;
start=1;
for(int i=2; i<=n; i++)
{
f>>v;
if(dp[i-1]<0)
{
dp[i]=v;
ind=i;
}
else
{
dp[i]=dp[i-1]+v;
if(smax<dp[i])
{
start=ind;
smax=dp[i];
poz=i;
}
}
}
g<<smax<<" "<<start<<" "<<poz;
return 0;
}
