牛客练习赛7 购物 DP 初始化问题

https://www.nowcoder.com/acm/contest/38/B

 dp[i][j] 代表第i天一共买了j个，dp[i][j]=dp[i-1][k]+pre[i][k~j]+(j-k)^2

 dp[i][j]=min(dp[i][j],dp[i-1][j-k]+d[i][k]);

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
#pragma GCC optimize(2)
#pragma comment(linker, "/STACK:102400000,102400000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair <int, int> ii;
const int INF=~0U>>1;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e5+10;
const int maxx=1e3+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

//void readString(string &s)
//{
//	static char str[maxn];
//	scanf("%s", str);
//	s = str;
//}

int n,m;
int c[305][305];
LL d[305][305];
LL dp[305][305];
void solve()
{
    s_2(n,m);
    FOR(1,n,i)
        FOR(1,m,j)
            s_1(c[i][j]);
    FOR(1,n,i)
        sort(c[i]+1,c[i]+m+1);
    FOR(1,n,i)
    {
        d[i][0]=0;
        FOR(1,m,j)
            d[i][j]=d[i][j-1]+c[i][j];
        FOR(1,m,j)
        	d[i][j]+=(LL)j*j;
    }
	me(dp,-1);
    dp[0][0]=0;
    FOR(1,n,i)
    {
    	FOR(i,n,j)
    	{
    		dp[i][j]=dp[i-1][j];
    		FOR(1,m,k)
    		{
    			if(j-k>=i-1&&~dp[i-1][j-k])
    			{
    				if(dp[i][j]==-1) dp[i][j]=dp[i-1][j-k]+d[i][k];
    				else  dp[i][j]=min(dp[i][j],dp[i-1][j-k]+d[i][k]);
    			}
    		}
    	}
        
    }
    print(dp[n][n]);
}

int main()
{
    //freopen( "1.in" , "r" , stdin );
    //freopen( "1.out" , "w" , stdout );
    int t=1;
    //init();
    //s_1(t);
    for(int cas=1;cas<=t;cas++)
    {
        //printf("Case #%d: ",cas);
        solve();
    }
}

可是，可是，看到第一名的代码如此之短，点进去看了一下。

哇！金色传说！

对如闪电啊，原来平方数差距只是2*j+1啊，学到了

#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
priority_queue<long long,vector<long long>,greater<long long> > pq;
long long p[301];
int main()
{
    long long n,m,sum,x;
    scanf("%lld%lld",&n,&m);
    sum=0;
    for(long long i=0;i<n;i++)
    {
        for(long long j=0;j<m;j++)
            scanf("%lld",&p[j]);
        sort(p,p+m);
        for(long long j=0;j<m;j++)
            pq.push(p[j]+2*j+1);
        sum+=pq.top();
        pq.pop();
    }
    printf("%lld\n",sum);
    return 0;
}