Pagini recente » Cod sursa (job #1646840) | Cod sursa (job #810538) | Cod sursa (job #1643919) | Cod sursa (job #2072605) | Cod sursa (job #2176190)
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int MAXN=7000005;
///subsecventa de suma maxima
int i,j;
int s[MAXN],n;
int bestsum=std::numeric_limits<int>::min(),mini,idx,inceput,sfarsit;
int main()
{
f>>n;
for(i=1; i<=n ; i++)f >> s[i];
for (i=1; i<=n; i++)
{
s[i]= s[ i ]+ s[i - 1];
if(bestsum < s[i] - mini )bestsum=s[i]-mini, inceput=idx+1, sfarsit=i;
if(mini > s[i])
mini=s[i], idx=i;
}
g<<bestsum<<" "<<inceput<<" "<<sfarsit<<endl;
return 0;
}