Pagini recente » Cod sursa (job #968604) | Cod sursa (job #87767) | Cod sursa (job #3310554) | Cod sursa (job #554456) | Cod sursa (job #1998320)
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
int n, k, a[100], m_i, m_j, lungime, maxsum=0;
f >> n >> k;
for(int i=1; i<=n; i++) f >> a[i];
for(int i=1; i<=n-1; i++){
int sum=a[i];
lungime=1;
for(int j=i+1; j<=n; j++){
sum+=a[j];
lungime++;
if(sum>maxsum && lungime>k){
maxsum=sum;
m_i=i;
m_j=j;
}
}
}
g << m_i << ' ' << m_j << ' ' << maxsum;
return 0;
}