Cod sursa(job #2426159)
| Utilizator | Data | 26 mai 2019 14:05:53 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,x,v[50003],i,j,cmax,indi,indi2,cmin=25000,sum;
ifstream in("secv2.in");
ofstream out("secv2.out");
void citire()
{
v[0]=0;
for(i=1;i<=n;i++)
{
in>>x;
v[i]=v[i-1]+x;
}
}
void cautare()
{
for(i=k;i<=n;i++)
{
if(v[i-k]<v[j])j=i-k;
sum=v[i]-v[j];
if(sum>cmax)
{
cmax=sum;
indi=j;
indi2=i;
}
}
out<<indi+1<<" "<<indi2<<" "<<cmax;
}
int main()
{
in>>n>>k;
citire();
cautare();
return 0;
}
