Pagini recente » Cod sursa (job #2480210) | Cod sursa (job #2429565) | Cod sursa (job #1918690) | Cod sursa (job #898467) | Cod sursa (job #2343446)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
fstream f("secv2.in",ios::in);
fstream g("secv2.out",ios::out);
int n,k;
f >> n >> k;
int v[n+1];
int i,j;
for (i=1;i<=n;i++)
f >> v[i];
int a[n-k+2][n+1];
// for (i=1;i<=n;i++)
// for (j=1;j<=n;j++)
// a[i][j]=0;
int max=-30001;
for (i=1;i<=n-k+1;i++)
for (j=i;j<=n;j++)
{
a[i][j]=0;
if(i==j)
a[i][j]=v[j];
else
a[i][j]=a[i][j-1]+v[j];
if(a[i][j]>max){
max=a[i][j];
a[0][0]=i;
a[0][1]=j;
}
}
/* cout << endl;
for (i=1;i<=n-k+1;i++){
for(j=1;j<=n;j++)
cout << a[i][j] << " ";
cout << endl;
}*/
//cout << endl << a[0][0] << " " << a[0][1] << " " << max;
g << a[0][0] << " " << a[0][1] << " " << max;
}