Cod sursa(job #828083)
Utilizator | Data | 2 decembrie 2012 22:59:15 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int n,k,v[50005],p1,p2,s[50005],c,i,j,smax=-2000000,spoz,q;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
}
for(i=k;i<=n;i++)
{
q=1;
while(i-q>=k-1)
{
s[i]=s[i]-v[q-1];
if(s[i]>smax)
{
smax=s[i];
p1=q;
p2=i;
}
q++;
}
}
g<<p1<<" "<<p2<<" ";
g<<smax;
f.close();
g.close();
return 0;
}