Pagini recente » Cod sursa (job #1702367) | Cod sursa (job #897215) | Cod sursa (job #1802749) | Cod sursa (job #2922630) | Cod sursa (job #2720597)
#include <bits/stdc++.h>
using namespace std;
int k, n;
int v[50001];
int a[50001];
int b[50001];
int main()
{
freopen("secv2.in","r", stdin);
freopen("secv2.out","w", stdout);
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> v[i];
for(int i = 1; i <= n; i++) {
if(a[i-1] < 0)
{a[i] = v[i];
b[i] = i;
}
else
{a[i] = a[i-1] + v[i];
b[i] = b[i-1];
}
}
int max1 = a[1];
int max2 = b[1];
int max3 = 1;
for(int i = 2; i <= n; i++)
if(max1 < a[i])
{max1 = a[i];
max2 = b[i];
max3 = i;
}
cout << max2 << " " << max3 << " " << max1;
return 0;
}