Cod sursa(job #1618910)
| Utilizator | Data | 28 februarie 2016 08:58:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long v[6000000],suma[6000000],poz[6000000];
int main()
{
int n,i,sumamax=-999999,pi;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=n;i>=1;i--)
{
suma[i]=max(v[i]+suma[i+1],v[i]);
if(suma[i]>sumamax)
{
sumamax=suma[i];
pi=i;
}
}
i=pi;
g<<sumamax<<" "<<pi<" ";
while(suma[i]>0)
{
pi++;
i++;
}
g<<pi;
return 0;
}
