Cod sursa(job #2462787)
| Utilizator | Data | 27 septembrie 2019 20:09:22 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int sum[50001],v[50001];
int main()
{
int n,k,sc,smax,stc,stmax,drmax;
in>>n>>k;
for(int i=1; i<k; i++)
{
in>>v[i];
sum[i]=sum[i-1]+v[i];
}
sc=k*(-25000);
smax=-25001;
for(int i=k; i<=n; i++)
{
in>>v[i];
sum[i]=sum[i-1]+v[i];
sc+=v[i];
if(sum[i]-sum[i-k]>sc)
{
sc=sum[i]-sum[i-k];
stc=i-k+1;
}
if(sc>smax)
{
smax=sc;
stmax=stc;
drmax=i;
}
}
out<<stmax<<" "<<drmax<<" "<<smax;
return 0;
}
