Pagini recente » Cod sursa (job #1830673) | Cod sursa (job #1989518) | Cod sursa (job #3180885) | Cod sursa (job #1238129) | Cod sursa (job #984578)
Cod sursa(job #984578)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
#define MAX 6000001
long long int i,n,u,l;
int a[MAX];
int main()
{
fin>>n;
int min=INT_MAX, max=INT_MIN;
for(i=1;i<=n;i++)
{
fin>>a[i];
a[i]+=a[i-1];
if(a[i]>max)
{
max=a[i];
u=i;
}
}
for(i=1;i<=u;i++)
{
if(a[i]<min)
{
min=a[i];
l=i;
}
}
l++;
for(i=1;i<=n;i++)
cout<<a[i]<<" ";
fout<<max-min<<" "<<l<<" "<<u;
return 0;
}