0
点赞
收藏
分享

微信扫一扫

nyist 61 传纸条(一)(双线程DP)

Villagers 2022-08-04 阅读 30


题目地址:http://acm.nyist.net/JudgeOnline/problem.php?pid=61

思路:

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x3f3f3f3f;//1061109567
typedef long long LL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
int map1[51][51];
int dp[51][51][51][51];
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int m,n;
scanf("%d%d",&m,&n);
memset(dp,0,sizeof(dp));
for(int i=1; i<=m; i++)
{
for(int j=1; j<=n; j++)
{
scanf("%d",&map1[i][j]);
}
}
for(int i=1; i<=m; i++)
{
for(int j=1; j<=n; j++)
{
for(int k=i+1; k<=m; k++)
{
int l = i + j - k;
if(k <= 0)
continue;

}
}
}
}
return 0;
}



举报

相关推荐

0 条评论