Pagini recente » Cod sursa (job #661087) | Cod sursa (job #2118661) | Cod sursa (job #3332816) | Cod sursa (job #883456) | Cod sursa (job #3303681)
#include <iostream>
#include <vector>
using namespace std;
const int Max = 6e6;
vector <int> Sum;
int main()
{
int n, X, minSum, maxSum, St = 1, Dr = 1;
cin >> n;
Sum.resize(n + 1);
for (int i = 1; i <= n; i++)
{
cin >> X;
Sum[i] = X + Sum[i - 1];
}
maxSum = Sum[1];
for (int i = 1; i <= n; i++)
{
if (maxSum < Sum[i] - minSum)
{
maxSum = Sum[i] - minSum;
Dr = i;
}
if (minSum > Sum[i])
{
minSum = Sum[i];
St = i;
}
}
cout << maxSum << ' ' << St << ' ' << Dr;
return 0;
}