Cod sursa(job #2224518)
Utilizator | Data | 24 iulie 2018 12:30:04 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f ("secv2.in");
ofstream g ("secv2.out");
long long s[50005],sum;
int n,k,i,j,v[50005],t,c1,c2;
int main()
{f>>n>>k;
for(i=1;i<=n;i++){f>>v[i];
sum=sum+v[i];
s[i]=sum;}
for(i=k;i<=n;i++)
for(j=i;j<=n;j++)
{ if(t<s[j]-s[i-k]){t=s[j]-s[i-k];
c1=i-k+1;c2=j;}
}
g<<c1<<" "<<c2<<" "<<t;
return 0;
}