Pagini recente » Cod sursa (job #531143) | Cod sursa (job #1517864) | Concursuri organizate de infoarena | Cod sursa (job #1585556) | Cod sursa (job #1072512)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[100], n;
int main()
{
int i, s, st, dr, smax, p;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
smax=a[1];
p=st=dr=1;
for(i=1;i<=n;i++)
{
s=a[i];
p=i;
if(a[i]>0)
{
i++;
while(a[i]>0)
s+=a[i], i++;
}
if(smax<s)
smax=s,
dr=i-1,
st=p;
/*else if(smax==s)
{ if(dr-st < i-p-1)
dr=i-1, st=p;
}*/
}
g<<smax<<" "<<st<<" "<<dr;
return 0;
}