Cod sursa(job #1669125)
Utilizator | Data | 30 martie 2016 13:14:08 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
//#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream cin("secv2.in");
ofstream cout("secv2.out");
int ;
cin>>n>>k;
s[0]=0;
for(i=1;i<=k;i++){
cin>>x;
s[i]=s[i-1]+x;}
smax=sc=s[k];
pc=pmax=1;
umax=k;
for(i=k;i<=n;i++){cin>>x;
s[i]=s[i-1]+x;
if(s[i]-s[i-k]>sc+x) { sc=s[i]-s[i-k];pc=i-k+1;}else sc+=x;
}}
return 0;
}