Pagini recente » Cod sursa (job #871593) | Cod sursa (job #154988) | Cod sursa (job #429062) | Cod sursa (job #2154287) | Cod sursa (job #23655)
Cod sursa(job #23655)
#include<fstream.h>
int n,m,i,p,l,j,h,k,v[100],max,a,o,s,u;
int main()
{ifstream f("tricouri.in");
ofstream g("tricouri.out");
f>>n;f>>m;
for(i=1;i<=n;i++)
{f>>j;v[i]=j;}
for(j=1;j<=m;j++)
{f>>k;f>>p;max=0;
for(i=1;i<=n-1;i++)
{s=v[i];u=2;o=k;l=0;
while(l!=n)
{for(h=u;h<=o;h++)
s=s+v[h];
if(max<s)
max=s;
u++;o++;
l++;
}
}
g<<max<<'\n';
}
f.close();g.close();
return 0;
}