poj 3265 Problem Solving dp

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=3e2+9;
int a[maxn],b[maxn];
int suma[maxn],sumb[maxn];
int dp[maxn][maxn];
int main()
{
//    freopen("in.txt","r",stdin);
int m,p;
while(scanf("%d %d",&m,&p)!=EOF)
{
suma[0]=sumb[0]=0;
for(int i=1;i<=p;i++)
{
scanf("%d %d",&a[i],&b[i]);
suma[i]=suma[i-1]+a[i];
sumb[i]=sumb[i-1]+b[i];
}
memset(dp,50,sizeof(dp));
dp[0][0]=0;
for(int i=0;i<=p;i++)
for(int j=i;j>=0;j--)
{
for(int k=i;k<=p;k++)
{
if(suma[k]-suma[i]+sumb[i]-sumb[i-j]>m)
break;
if(sumb[k]-sumb[i]>m)
break;
dp[k][k-i]=min(dp[k][k-i],dp[i][j]+1);
}
}
printf("%d\n",dp[p][0]+1);
}
return 0;
}