摘要：#include<bits/stdc++.h>using namespace std;vector<int>g[2007];int fa[2007],vis[2007],num[2007];char s[2007][2007];int find_(int x){ if(fa[x]==x) retur 阅读全文

摘要：#include<bits/stdc++.h>using namespace std;int a[5007];int dp[5007][5007];int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); 阅读全文

摘要：#include<bits/stdc++.h>using namespace std;int dp[1000007][7][7];int cnt[1000007];int main(){ int n,m; scanf("%d%d",&n,&m); int x=0; for(int i=1;i<=n; 阅读全文

摘要：#include<bits/stdc++.h>using namespace std;char s[100007];long long a[100007];long long dp[100007][4];int main(){ int n; scanf("%d",&n); scanf("%s",s) 阅读全文

摘要：#include<bits/stdc++.h>using namespace std;long long dp[507][507];const long long mod = 998244353;int main(){ int n,k; scanf("%d%d",&n,&k); for(int i= 阅读全文

摘要：#include<bits/stdc++.h>using namespace std;long long n,v,a,b,c,d,e;int main(){ scanf("%d",&n); while(n--){ scanf("%d",&v); a+=v;//记录前面全清零需要的花费 b=min(b 阅读全文

摘要：#include<bits/stdc++.h>using namespace std;int cnt[10]={0,2,5,5,4,5,6,3,7,6};int dp[10007];int vis[17];int main(){ int n,m; scanf("%d%d",&n,&m); memse 阅读全文