Pagini recente » Cod sursa (job #1582327) | Cod sursa (job #1284379) | Cod sursa (job #381958) | Cod sursa (job #969621) | Cod sursa (job #1348204)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("smm.in");
ofstream fout("smm.out");
#define LG 600005
int n,v[LG],s[LG],p[LG],maxim;
void sume (int i)
{
if ( i != n+1 )
if ( s[i-1] > 0 )
{
s[i] = v[i] + s[i-1];
p[i] = p[i-1];
sume(i+1);
}
else
{
s[i] = v[i];
p[i] = i;
sume(i+1);
}
}
int main()
{
fin>>n;
int i;
for (i = 1; i <= n; i++)
fin>>v[i];
s[1] = v[1];
p[1] = 1;
sume(2);
maxim = 1;
for (i = 2; i <= n ; i++)
if (s[i] > s[maxim])
maxim = i;
fout<<s[maxim]<<" "<<p[maxim]<<" "<<maxim<<'\n';
fin.close();
fout.close();
return 0;
}