Cod sursa(job #460001)
| Utilizator | Data | 31 mai 2010 22:14:29 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int a[50001];
long long s[50001];
int N,K,p,p2;
int main ()
{
int i;
in>>N>>K;
for(i=1;i<=N;i++)
in>>a[i],s[i]=a[i]+s[i-1];
long long maxim = -500000000;
for(i=K;i<=N;i++)
if(maxim<s[i])
maxim=s[i],p=i;
long long minim = 50000000;
for(i=p;i>0;i--)
if(minim>s[i]&&p-i>=K)
minim=s[i],p2=i;
if(minim==50000000)
minim=0;
out<<p2+1<<' '<<p<<' '<<maxim-minim;
return 0;
}