Pagini recente » Cod sursa (job #1769641) | Cod sursa (job #1168690) | Cod sursa (job #830871) | Cod sursa (job #1185102) | Cod sursa (job #2430159)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,A[6000010];
int main()
{
fin>>n;
int minim = 1000000000,maxim = -1000000000,minimIndex,maximIndex,maximSuma = -100000000,maximSmin,maximSmax;
for(int i = 1; i<=n; i++)
{
fin>>A[i];
A[i]+=A[i-1];
if(A[i]>maxim)
{
maximIndex =i;
maxim = A[i];
}
if(A[i]<minim)
{
minimIndex = i;
minim = A[i];
}
if((maxim-minim)>maximSuma)
{
maximSmin = minimIndex;
maximSmax = maximIndex;
maximSuma = (maxim-minim);
}
}
fout<<maximSuma<<" "<<maximSmin+1<<" "<<maximSmax<<'\n';
return 0;
}