Cod sursa(job #1768254)
Utilizator | Data | 30 septembrie 2016 16:32:20 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,k,v[50001],i,j,i1,j1,maxi,sum;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
j=1;
maxi=0;
while(j<=n-k)
{
i=j;
sum=0;
for(;i<=n;i++)
{
sum+=v[i];
if(i-k>=0)
if(sum>maxi)
{
maxi=sum;
i1=i;
j1=j;
}
}
j++;
}
g<<j1<<" "<<i1<<" "<<maxi;
g.close();
return 0;
}