Cod sursa(job #272925)
| Utilizator | Data | 7 martie 2009 22:57:01 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const char in[]="secv2.in";
const char out[]="secv2.out";
const int maxn=50000;
int main()
{
ifstream fin(in);
int n,s,k,sum=0,maxsum=-50000,idx=0,end=0 ,begin=0;
fin>>n>>k;
for(int i=1;i<=n;i++)
{
fin>>s;
if(sum<0)
{
sum=s;
idx=i;
}
else
sum+=s;
if(maxsum<sum && i-idx>=k)
{
maxsum=sum;
begin=idx;
end=i;
}
}
ofstream fout(out);
fout<<begin<<' '<<end<<' '<<maxsum;
return 0;
}