Cod sursa(job #2129809)
| Utilizator | Data | 13 februarie 2018 09:41:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long s[6000001],v[6000001];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,i,maxi=1,maxj=1,maxim,minim;
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
s[1]=v[1];
for (i=2;i<=n;i++)
s[i]=s[i-1]+v[i];
maxim=s[1];
minim=s[1];
for (i=1;i<=n;i++)
if (s[i]>maxim)
{maxim=s[i];
maxi=i;}
for (i=1;i<=n;i++)
if (s[i]<minim&&i<maxi)
{minim=s[i];
maxj=i;}
g<<maxim-minim<<" "<<maxj+1<<" "<<maxi;
}
