Pagini recente » Cod sursa (job #808088) | Cod sursa (job #631420) | Cod sursa (job #720096) | Cod sursa (job #1001927) | Cod sursa (job #728181)
Cod sursa(job #728181)
#include <fstream>
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n;
int i;
int a[600];
int s[600];
int poz[600];
ifstream f("ssm.in");
f>>n;
for (i=1; i<=n; i++) {
f>>a[i];
s[i]=s[i-1]+a[i];
}
f.close();
/*for (i=0; i<=n; i++)
cout<<s[i]<<' ';*/
int min=0;
for (i=1; i<=n; i++) {
if (a[i] < a[min]) min=i;
poz[i]=min;
}
int max=-1;
int begin,end;
for (i=1; i<=n; i++)
if (s[i]-s[poz[i]] > max) {
max=s[i]-s[poz[i]];
begin=poz[i]+1;
end=i;
}
freopen("ssm.out","w",stdout);
printf("%d %d %d%c",max,begin,end,'\n');
return 0;
}