Pagini recente » IOIT_CAZAN_137TESLA | Autentificare | Cod sursa (job #2389098) | Cod sursa (job #2436639) | Cod sursa (job #3290223)
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int n;
cin >> n;
int a[n + 1], s[n + 1];
cin >> a[1];
s[1] = a[1];
for (int i = 2; i <= n ; i++)
{
cin >> a[i];
if (s[i - 1] >= 0)
s[i] = s[i - 1] + a[i];
else
s[i] = a[i];
}
int poz_maxim = 1;
for (int i = 2; i <= n ; i++)
if (s[i] > s[poz_maxim])
poz_maxim = i;
int inceput = poz_maxim;
while (inceput > 0)
{
if (a[inceput] == s[inceput])
break;
inceput--;
}
cout << s[poz_maxim] << ' ' << inceput << ' ' << poz_maxim;
return 0;
}