Cod sursa(job #1734711)
| Utilizator | Data | 27 iulie 2016 23:32:35 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include<fstream>
using namespace std;
int v[6000001],s[6000001]={0};
int main()
{
int n,m,p,i,ss=0;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
p=1;
m=v[1];
for(i=1;i<=n;i++)
{
s[i]=v[i];
if(s[i]<s[i-1]+v[i])
s[i]=s[i-1]+v[i];
if(s[i]>m)
{
m=s[i];
p=i;
}
}
i=p;
while(ss!=m)
{
ss+=v[i--];
}
g<<m<<" "<<i+1<<" "<<p;
return 0;
}
