Cod sursa(job #2000873)
Utilizator | Data | 14 iulie 2017 22:07:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
long dp[6000002];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
f>>n;
for(int i=1;i<=n;i++)
{
int x; f>>x;
dp[i]=dp[i-1]+x;
}
int j=0,x,y;
long vmax=dp[0];
for(int i=1;i<=n;i++)
{
if(dp[i]-dp[j]>vmax)
{
vmax=dp[i]-dp[j];
y=i;
}
if(dp[i]<dp[j])
{
j=i;
x=i+1;
}
}
g<<vmax<<" "<<x<<" "<<y<<'\n';
f.close();
g.close();
return 0;
}