摘要： 01背包的变形。代码：#include<iostream>#include<fstream>using namespace std;int dp[20000001];int n,h;int a[21];void read(){// ifstream cin("in.txt"); int i,j,k=0; cin>>n>>h; for(i=1;i<=n;i++) { cin>>a[i]; k+=a[i]; } for(j=1;j<=a[1];j++) dp[j]=a[1]; for(j=a[1]+1;j& 阅读全文

摘要： 不降子序列。代码：#include<iostream>#include<fstream>using namespace std;int a[30001];int n;int b[30001];int find(int s,int value){ int i=0,k; while(i<=s) { k=(i+s)>>1; if(b[k]>value) s=k-1; else i=k+1; } return s;}void read(){// ifstream cin("in.txt"); int i,j,k,m,m1; cin&g 阅读全文

摘要： 简单题代码：#include<iostream>#include<fstream>using namespace std;long long a[20001];long long solve(long long s,long long t){ if(s<t) return s; else return t;}void read(){// ifstream cin("in.txt"); long long i,j,k; long long p1,p2,p3,n1,n2,n3; cin>>p1>>p2>>p3&g 阅读全文

摘要： 贪心代码：#include<iostream>#include<fstream>using namespace std;int a[1001];int n,m;int cmp(const void *a,const void *b){ return *(int*)a-*(int*)b;}void read(){// ifstream cin("in.txt"); int i,j,k; while(cin>>m>>n) { if(m==-1&&n==-1) return; for(i=0;i<n;i++) 阅读全文

摘要： 水题。代码：#include<iostream>#include<fstream>using namespace std;void read(){// ifstream cin("in.txt"); int i,j,k; int n1,n2,n3,n4; cin>>k; for(i=1;i<=k;i++) { cin>>j; n1=j/25; j%=25; n2=j/10; j%=10; n3=j/5; j%=5; n4=j; printf("%d %d QUARTER(S), %d DIME(S), %d N 阅读全文

摘要： 贪心代码：#include<iostream>#include<fstream>using namespace std;struct e{ int s,t;};e a[10001];int n;int cmp(const void *a,const void *b){ e *s=(e*)a; e *t=(e*)b; if(s->s!=t->s) return s->s-t->s; else return s->t-t->t;}void read(){// ifstream cin("in.txt"); int i, 阅读全文

摘要： 贪心。代码：#include<iostream>#include<fstream>using namespace std;void read(){// ifstream cin("in.txt"); int i,j,k,s,t; while(cin>>s>>t) { t=-t; if(s*4+t<0) { if(10*s+2*t>0) cout<<10*s+2*t<<endl; else cout<<"Deficit"<<endl; } else 阅读全文

摘要： 贪心水题。代码：#include<iostream>#include<fstream>using namespace std;long long n,L;struct e{ long long s,t;};e a[10001];int cmp(const void *a,const void *b){ return (*(e *)a).s-(*(e *)b).s;}void read(){// ifstream cin("in.txt"); long long i,j,k; cin>>n>>L; for(i=0;i<n; 阅读全文

摘要： 贪心代码：#include<iostream>#include<fstream>#include<queue>using namespace std;int n;typedef struct e{ int s,t; bool friend operator <(const e &a,const e &b){ return a.t<b.t; }}e;e a[10001];int cmp(const void *a,const void *b){ return (*(e*)a).s-(*(e*)b).s;}priority_queue 阅读全文

摘要： 贪心。代码：#include<iostream>#include<fstream>using namespace std;long long n;void read(){// ifstream cin("in.txt"); long long i,j,k,s,t,minn; long long ans=0; cin>>n>>k; cin>>s>>t; ans=s*t; minn=s; for(i=1;i<n;i++) { cin>>s>>t; minn=min(minn+k 阅读全文