Cod sursa(job #313163)
| Utilizator | Data | 8 mai 2009 08:00:54 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
#define maxn 50005
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[maxn],i,j,n,m,M,k,s[maxn],l,r,mp;
int main()
{
f>>n>>k;
for(i=1;i<=n;++i)
f>>a[i],s[i]=s[i-1]+a[i];
m=0;
mp=0;
M=0x3f3f3f3f;
M=-M;
for(i=k;i<=n;++i)
{
if(s[i]-m>M) M=s[i]-m,l=mp+1,r=i;
if(s[i-k+1]<m) m=s[i-k+1],mp=i-k+1;
}
g<<l<<" "<<r<<" "<<M<<"\n";
f.close();
g.close();
return 0;
}
