Pagini recente » Cod sursa (job #1225271) | Cod sursa (job #1982846) | Cod sursa (job #1558080) | Cod sursa (job #2484099) | Cod sursa (job #656827)
Cod sursa(job #656827)
#include<fstream>
#includ<algoritm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout(ssm.out);
const int MAXN = 7000005
int s[MAXN], n;
int main()
{
fin >> n;
for( int i = 1; i <= n; i++ )
fin >> s[i];
int Summ = -int(2e9), min = 0, idx, beg, end;
for( int i = 1; i <= n; i++ )
{
s[i] += s[i-1];
if ( Summ < s[i] - min )
{
Summ = s[i] - min;
beg = idx + 1;
end = i;
}
if( min > s[i] )
min = s[i], idx = i;
}
fout << Summ << " " << beg << " " << end;
fin.close();
fout.close();
return 0;
}