Cod sursa(job #352395)
| Utilizator | Data | 1 octombrie 2009 16:46:19 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int x,s[50001];
int main()
{
int i,j,k,poz1,poz2,max=0,n;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>x;
s[i]=s[i-1]+x;
}
for(i=k;i<=n;i++)
{
for(j=i-k;j>=0;j--)
if(s[i]-s[j]>max)
{
max=s[i]-s[j];
poz1=j+1;
poz2=i;
}
}
g<<poz1<<" "<<poz2<<" "<<max;
f.close();
g.close();
return 0;
}