Pagini recente » Cod sursa (job #820198) | Borderou de evaluare (job #1873139) | Cod sursa (job #2113207) | Cod sursa (job #3312973) | Cod sursa (job #3350862)
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int n,v[100001],s=0,indicestart=-1,indicefinal=-1,indicestartmax=-2,indicefinalmax=-2,sumamax=-1;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=1;i<=n;i++)
{
indicestart=i;
s=0;
int j=i;
s+=v[i];
while(j+1<=n&&s+v[j+1]>=0){
indicefinal=j+1,s+=v[j+1];
if(s>sumamax)
indicestartmax=indicestart,indicefinalmax=indicefinal,sumamax=s;
j++;
}
}
cout<<sumamax<<" "<<indicestartmax<<" "<<indicefinalmax;
}