Cod sursa(job #3361679)
| Utilizator | Data | 27 iulie 2026 18:51:34 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[50001];
int main()
{
ifstream cin ("secv2.in");
ofstream cout ("secv2.out");
int n,k,sum=0,maxsum=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>v[i];
for(int i=1;i<=n-k;i++)
{
for(int j=0;j<k;j++)
sum=sum+v[i+j];
if(sum>maxsum)
maxsum=sum;
sum=0;
}
cout<<maxsum;
return 0;
}
