Description
Solution
贪心的想,如果已经确认了选哪些点,那么顺序一定是以W的值排列,
所以按照这个性质,按w从大到小排个序,然后倒着选,
用DP来实现,
复杂度:
O(n2)
Code
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=5500,maxlongint=2147483640;
int read(int &n)
{
char ch=' ';int q=0,w=1;
for(;(ch!='-')&&((ch<'0')||(ch>'9'));ch=getchar());
if(ch=='-')w=-1,ch=getchar();
for(;ch>='0' && ch<='9';ch=getchar())q=q*10+ch-48;n=q*w;return n;
}
int m,n,ans;
struct qqww{int v,w;}a[N];
int f[N][N],g[N];
bool PX(qqww q,qqww w){return q.w>w.w;}
int main()
{
int q,w;
read(n);
fo(i,1,n)read(a[i].v),read(a[i].w);
sort(a+1,a+1+n,PX);
fo(i,1,n)
{
f[i][1]=a[i].v;
fod(j,n,1)
if(f[i][j+1]<g[j]+a[i].v-a[i].w*j)
{
f[i][j+1]=g[j]+a[i].v-a[i].w*j;
g[j+1]=max(g[j+1],f[i][j+1]);
}
g[1]=max(g[1],a[i].v);
}
fo(i,1,n)ans=max(ans,g[i]);
printf("%d\n",ans);
return 0;
}