Pagini recente » Cod sursa (job #3215854) | Cod sursa (job #1315446) | Cod sursa (job #2813502) | Cod sursa (job #141048) | Cod sursa (job #3165953)
#include <fstream>
#include <algorithm>
#include <climits>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int s[101],v[101],n;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
s[1]=v[1];
int dr=1, st=1,smax=INT_MIN;
for(int i=2; i<=n; i++)
{
if(s[i-1]+v[i]>v[i])
{
s[i]=s[i-1]+v[i];
dr++;
}
else
{
s[i]=v[i];
st=i;
}
}
for(int i=1; i<n; i++)
smax=max(s[i],s[i+1]);
cout<<smax<<' '<<st<<' '<<dr;
return 0;
}