Cod sursa(job #2420155)
Utilizator | raul rotar raul41917 | Data | 10 mai 2019 20:06:39 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int v[6000001],ssm[6000001];
int main()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
ssm[0]=0;
for(i=1;i<=n;i++)
{
ssm[i]=ssm[i-1]+v[i];
}
int mn=0,ans=0;
int indmn=1,indans=n;
for(i=1;i<=n;i++)
{
if(mn>ssm[i])
indmn=i+1;
if(ans<ssm[i]-mn)
indans=i;
mn=min(mn,ssm[i]);
ans=max(ans,ssm[i]-mn);
}
fout<<ans<<" "<<indmn<<" "<<indans;
fin.close();
fout.close();
return 0;
}