#include<iostream> #include<stdio.h> #include<cstring> using namespace std; int a[101],c[101]; int num[100001],f[100001]; int main() { int n,m; while(scanf("%d %d",&n,&m)!=EOF) { if(n==0&&m==0) break; int sum=0; for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int i=1;i<=n;i++) scanf("%d",&c[i]); memset(f,0,sizeof(f)); f[0]=1; for(int i=1;i<=n;i++) { memset(num,0,sizeof(num)); for(int j=a[i];j<=m;j++) { if(!f[j]&&f[j-a[i]]&&num[j-a[i]]<c[i]) { num[j]=num[j-a[i]]+1; sum++; f[j]=1; } } } printf("%d\n",sum); } return 0; }
]]>
#include<iostream>#include<stdio.h>const int MIN = -999999999;//瀹氫箟MIN涓哄彧璇誨彉閲?nbsp;涓轟竴涓潪甯稿皬鐨勫?/span>int a[100001];int ans[100001];using namespace std;int main()
{
int n; int an; while(scanf("%d",&n)!=EOF)
{ if(n==0) break; int sum=0; int k=MIN; for(int i=1;i<=n;i++) { scanf("%d",&a[i]); sum+=a[i]; if(sum>k) k=sum; ans[i]=k;//絎琲涓暟鍓嶇殑鏈澶ц繛緇拰涓篴ns[i] if(sum<0)//濡傛灉sum<0 鍒欒垗寮冨墠闈㈢殑鏁?nbsp;sum浠庝笅涓涓暟寮濮嬪姞 sum=0;
} sum=0; k=an=MIN; for(int j=n;j>1;j--)//鍙嶆柟鍚戞煡鎵?/span> { sum+=a[j]; if(sum>k) k=sum; if(an<(ans[j-1]+k))//浠庡悗鏁板墠n-j+1涓暟鐨勬渶澶ц繛緇拰k 鍔犱笂 姝ｆ暟絎琷-1涓暟鐨勬渶澶ц繛緇拰 an=ans[j-1]+k;//鐢╝n if(sum<0)//濡傛灉sum<0 鍒欒垗寮冨墠闈㈢殑鏁?nbsp;sum浠庝笅涓涓暟寮濮嬪姞 sum=0; } printf("%d\n",an); } return 0;
}]]>