Pagini recente » Cod sursa (job #2362406) | Cod sursa (job #2832285) | Cod sursa (job #1260371) | Cod sursa (job #51005) | Cod sursa (job #1211847)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,v[100000],p1,p2,bestSum,sum,l,k;
f>>n;
f>>l;
for(int i=1;i<=n;i++)
{
f>>v[i];
}
bestSum = -25001;
for (int i = 1; i <= n; i++) {
for (int j = i; j <=n; j++) {
sum = 0;
for ( k = i; k <= j; k++) sum += v[k];
if (bestSum < sum&&k-1-i>=l){
p1=i;
p2=k-1;
bestSum = sum;
}
}
}
g<<p1<<" "<<p2<<" "<<bestSum;
//for(int i=p1;i<=p2;i++)
// cout<<v[i]<<" ";
cout << "Hello world!" << endl;
return 0;
}