Cod sursa(job #2151779)
| Utilizator | Data | 4 martie 2018 21:39:54 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,j,i,smax,min1,p,a,u,k;
int x[50001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++) f>>x[i];
for(i=1;i<k;i++) x[i]=x[i]+x[i-1];
smax=-125000000; min1=125000000; a=1;
for(i=1;i<=n;i++){
x[i]=x[i]+x[i-1];
if(smax<x[i]-min1&&(i-a>=k)) { smax=x[i]-min1; p=a+1; u=i; }
if(min1>x[i]) { min1=x[i]; a=i; }
// g<<smax<<' '<<min1<<'\n';
}
g<<p<<' '<<u<<' '<<smax<<'\n';
return 0;
}
