Pagini recente » Cod sursa (job #3168517) | Cod sursa (job #2815174) | Cod sursa (job #1376018) | Cod sursa (job #904317) | Cod sursa (job #1597596)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000001];
int main()
{
int n,i,j,max1=-2000000000,min1=2000000000,pzm,pzmin;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=2;i<=n;i++)
a[i]+=a[i-1];
for(i=1;i<=n;i++)
{
if(a[i]>max1)
{
max1=a[i];
pzm=i;
}
else
if(a[i]<min1)
{
min1=a[i];
pzmin=i;
}
}
max1-=min1;
g<<max1<<" "<<pzmin+1<<" "<<pzm;
return 0;
}