一地鸡毛

解答=========C  与链

1 算日期，wa很奇怪 #includetypedef long long int LL;#include #include#include "assert.h"using namespace std;char a[200],b[200],c[200], s[200];LL func(LL a, LL b, int k){ LL a1 = (a+k-1)/k;

x男， y女， 工资、 能力最大值， 最小序列#include #include#include #include using namespace std;#include int main(){ int ms,x, y,n; cin>>n>>x>>y>>ms;cin.get(); vector s(n, 0); vector b(n, 0); ve

#include#include using namespace std;void dfs(vector > &edges,vector > &tree,int p,int n){ for(int i=0;i<edges[n].size();i++){ int j=edges[n][i]; if(p==j) continue; tree[n].push_back(

Maximal Rectangle Total Accepted: 9039 Total Submissions: 41503My SubmissionsGiven a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return i

第二题  长数字串运算计数长度为D的数字串（D两次DP  第一次用于区间[l, r] 对应的大整数对小整数 求余（见数字分类下的某篇文章）。 第二次是区间分解dp。算法code: https://github.com/stevenberge/acm/blob/master/gcj/20081c2.cc第三题 递增子序列计数 给定一个数列，求严格的单增子序

这个题目的地推方程优良种

递推方程：

Binary Tree Maximum Path Sum Total Accepted: 14936 Total Submissions: 75024My SubmissionsGiven a binary tree, find the maximum path sum.The path may start and end at any node in the tr

Regular Expression Matching Total Accepted: 13504 Total Submissions: 67886My SubmissionsImplement regular expression matching with support for '.' and '*'.'.' Matches any single charac

class Solution {public: bool isInterleave(string s1, string s2, string s3) { int n=s1.length(),m=s2.length(); if(n+m!=s3.length()) return false;///@@@error: s3.length can be not q

题目1 : 彩色的树时间限制:2000ms单点时限:1000ms内存限制:256MB描述给定一棵n个节点的树，节点编号为1, 2, …, n。树中有n - 1条边，任意两个节点间恰好有一条路径。这是一棵彩色的树，每个节点恰好可以染一种颜色。初始时，所有节点的颜色都为0。现在需要实现两种操作:1. 改变节点x的颜色为y；2. 询问整