Cod sursa(job #2193770)
Utilizator | Data | 11 aprilie 2018 14:47:56 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int i,n,k,p,p1,p2,sum,x,s[100001];
int main()
{ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
{f>>x;
s[i]=s[i-1]+x;}
p1=1;
p2=k;
sum=s[k];
for(i=k+1;i<=n;i++)
{
if(s[i-k]<s[p])
p=i-k;
if(s[i]-s[p]>sum)
{
sum=s[i]-s[p];
p1=p+1;
p2=i;
}
}
g<<p1<<" "<<p2<<" "<<sum;
return 0;
}