Pagini recente » Cod sursa (job #1240833) | Cod sursa (job #877354) | Cod sursa (job #2718995) | Cod sursa (job #1792182) | Cod sursa (job #2324008)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("secv2.in");
ofstream fout ("secv2.out");
int n,i,j,s[6000005],a,b,maxsum=-99999,minsum,k;
bool test;
int main()
{
fin >> n>>k;
for (i=1;i<=n;i++)
{
fin >>s[i];
s[i]+=s[i-1];
if (maxsum<s[i]-minsum&&i>k)
{
maxsum=s[i]-minsum;a=j+1;b=i;
}
if (minsum>s[i])
{
minsum=s[i];j=i;
}
}
if(k==n) fout << 1<<" "<< n<<" "<< s[n];
else
fout<< a<<" "<<b<<" "<<maxsum;
return 0;
}