Cod sursa(job #441748)
| Utilizator | Data | 13 aprilie 2010 11:54:38 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
int v[50005],maxim,n,final,inceput,k;
void SSM();
int main()
{
ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin>>n>>k;
int i;
for(i=1;i<=n;i++)
fin>>v[i];
SSM();
fout<<inceput<<" "<<final<<" "<<maxim;
return 0;
}
void SSM()
{
int sum,index=1,i;
sum=v[1];
for(i=2;i<=n;i++)
{
if(sum<0)
sum=v[i],index=i;
else
sum+=v[i];
if(i-index>=k && sum>maxim)
maxim=sum,final=i,inceput=index;
}
}
