Pagini recente » Cod sursa (job #1130625) | Cod sursa (job #682280) | Cod sursa (job #1053476) | Cod sursa (job #1037598) | Cod sursa (job #1597591)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("da");
ofstream g("nu");
int a[6000000];
int main()
{
int n,i,j,max1=-32000,min1=32000,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;
}