|
|
×
提示!该题解未通过审核,建议分享者本着启发他人,照亮自己的初衷以图文并茂形式完善之,请勿粘贴代码。#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define x first #define y second using namespace std; typedef pair<char,char> PCC;
const int N = 3010; PCC pcc[N];
int main() { int n, len; cin >> n >> len; if(n == 1){ puts("1"); return 0; } for(int i = 1; i <= n; i ++) { string s; cin >> s; char minc = s[0], maxc = s[0]; for(int j = 1; j < len; j ++ ) {
if(s[j] < minc) minc = s[j 该题解等待再次审核........................................................................(剩余 955 个中英字符)
题目3953 [NOIP 2023]词典
2024-07-17 09:40:09
|
|
|
Pro3979 篮球 题解
×
dfs意义:从x过来的最小值
记忆化dfs定义f数组存储结果
//dfs函数
long long int dfs(int x,int lwalk,int rwalk)
{
if(f[x][lwalk][rwalk]!=0x7f7f7f7f7f7f7f7f) return f[x][lwalk][rwalk];
if(x==0) return f[x][lwalk][rwalk]=0;
if(lwalk==0&&rwalk==0&&mp[b[x]]) return f[x][lwalk][rwalk]=min(min(min(min(dfs(x-1,0,0),dfs(x-1,1,0)),dfs(x-1,2,0)),dfs(x-1,0,1)),dfs(x-1,0,2));
else if(lwalk==0&&rwalk==1) return f[x][lwalk][rwalk]=min(min(dfs(x-1,1,0)+r[x],dfs(x-1,2,0)+r[x]),dfs(x-1,0,0)+r[x]);
else提示!该题解未通过审核,建议分享者本着启发他人,照亮自己的初衷以图文并茂形式完善之,请勿粘贴代码。........................................................................ 该题解等待再次审核........................................................................(剩余 492 个中英字符)
题目3979 篮球
AAAAAAAAAAAAAAAAAAAA
2024-06-22 03:56:21
|
|
|
Pro3979 篮球 题解
×
#include<bits/stdc++.h> using namespace std; int main() { freopen("split.in","r",stdin); freopen("split.out","w",stdout); int a,i=2; cin>>a; &n提示!该题解未通过审核,建议分享者本着启发他人,照亮自己的初衷以图文并茂形式完善之,请勿粘贴代码。........................................................................ 该题解等待再次审核........................................................................(剩余 568 个中英字符)
题目3979 篮球
2024-05-28 20:36:09
|
|
|
×
提示!该题解未通过审核,建议分享者本着启发他人,照亮自己的初衷以图文并茂形式完善之,请勿粘贴代码。#include<bits/stdc++.h> using namespace std; int main() { freopen("title.in","r",stdin); freopen("title.out","w",stdout); char n[5]; int m,l; gets(n); m=strlen(n);
该题解等待再次审核........................................................................(剩余 294 个中英字符)
题目3049 [NOIP 2018PJ]标题统计
2024-01-04 20:08:13
|
|
|
×
提示!该题解未通过审核,建议分享者本着启发他人,照亮自己的初衷以图文并茂形式完善之,请勿粘贴代码。
一个 n log 该题解等待再次审核........................................................................(剩余 15 个中英字符)
题目2353 [HZOI 2015] 有标号的DAG计数 I
AAAAAAAAAA
2023-11-09 19:00:38
|