Pagini recente » Cod sursa (job #1771941) | Cod sursa (job #2227368) | Cod sursa (job #352205) | Cod sursa (job #718612) | Cod sursa (job #3041524)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main()
{
int n, k, suma = 0, st, dr, max = -100000000;
fin >> n >> k;
int sir[n + 1];
fin >> sir[1];
for(int i = 2; i <= n; ++i) {
fin >> sir[i];
sir[i] += sir[i - 1];
}
st = sir[1];
for(int i = 1; i <= n; ++i) {
if(sir[i] <= sir[st]) {
st = i;
dr = i;
}
if(sir[i] > sir[dr]) {
dr = i;
if(sir[dr] - sir[st] > max) {
max = sir[dr] - sir[st];
}
}
}
fout << st << " " << dr << " " << max;
return 0;
}