Pagini recente » Cod sursa (job #829107) | Cod sursa (job #1375599) | Cod sursa (job #673593) | Cod sursa (job #429508) | Cod sursa (job #1901992)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,i,j,el,poz,fin,maxim=-9999999;
vector <int> a;
int main()
{
f>>n>>k;
for(i=0;i<n;i++)
{
f>>el;
a.push_back(el);
if(i) a[i]+=a[i-1];
}
if(k!=n)
{for(i=k;i<n;i++)
for(j=0;j<=i-k;j++)
if(a[i]-a[j]>maxim) maxim=a[i]-a[j],poz=j+1,fin=i;
g<<poz+1<<" "<<fin+1<<" "<<maxim;}
else g<<"1 "<<n<<" "<<a[n-1];
return 0;
}