Cod sursa(job #2409832)
Utilizator | Data | 19 aprilie 2019 14:08:29 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int sum, pi, pj, summ, n, k, v[50001];
int main()
{
int i, j;
fin>>n>>k;
for(int i=1;i<=n;++i)
{
fin>>v[i];
v[i]+=v[i-1];
}
i=k, j=0, sum=v[k];
pi=k, pj=0, summ=v[k];
for(i=k;i<=n;++i)
{
if(v[i-k]<v[j]) j=i-k;
sum=v[i]-v[j];
if(sum>summ)
{
summ=sum;
pj=j;
pi=i;
}
}
fout<<pj+1<<" "<<pi<<" "<<summ<<"\n";
return 0;
}