Cod sursa(job #1402206)
| Utilizator | Data | 26 martie 2015 13:30:02 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
short v[50001];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
short n,k,inc=1,minim=30000,fina,poz1,fina1,poz2,i,poz,a;
long long s=0,maxim=-900000000000;
f>>n;
f>>k;
poz=1;
for(i=1;i<=n;i++)
{
f>>v[i];
//if(minim<v[i]) {minim=v[i];poz2=i;}
s+=v[i];
if(maxim<s and i-poz+1>=k) {maxim=s;fina1=i;poz1=poz;}
if(s<0 and i-poz+1>=k){poz=i+1;s=0;}
}
g<<poz1<<" "<<fina1<<" "<<maxim;
f.close();
g.close();
return 0;
}
