Pagini recente » Cod sursa (job #550609) | Borderou de evaluare (job #895890) | Cod sursa (job #701793) | Cod sursa (job #669017) | Cod sursa (job #2239353)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int n,v[6000006];
int sp[6000006];
int minim = INT_MAX;
int maxim = INT_MIN;
int minpoz=1,maxpoz=1;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
{
sp[i] = sp[i-1] + v[i];
for(int j=0;j<=i-1;j++)
{
if(sp[j]<minim){
minim = sp[j];
minpoz = j+1;
}
}
if(sp[i] - minim > maxim){
maxim = sp[i] - minim;
maxpoz = i;
}
}g<<maxim<<' '<<minpoz<<' '<<maxpoz;
return 0;
}