Cod sursa(job #2308317)
Utilizator | Data | 26 decembrie 2018 20:47:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
long long n,i,nr,s_max=0,s=0,v[10000],poz,ok=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
s+=v[i];
if(s>s_max)
{
poz=i;
s_max=s;
ok++;
}
if(s<0)
{
s=0;
}
}
s=0;
i=poz;
ok=poz;
while(s<s_max)
{
s+=v[i--];
ok=ok--;
}
//ok++;
cout<<s_max<<" "<<ok<<" "<<poz;
}