传送门 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include <string> #include &...

传送门 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include <string> #include ...

//MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include <string> #include <c...

初学状态压缩 对位运算不太了解传送门 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include <strin...

如果用按位操作符就一定要加括号。。除非你能都搞懂…还有啊 这题get到新知识 二分式比赛的方法 题目链接 //MADE BY Y_is_sunshine; //#include //#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define INF 0x3f3f3f3f #define MAXN 1005 const int mod = 1e9 + 7; c...

ORZ #include <iostream> #include <string> #include <algorithm> #define llint long long #define inf 1000000000000000000 using namespace std; string s; llint cnt[15]; llint cost[15]; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> s; for (int i = 1; i <...

POJ 2096 标程可能有问题… 最后输出要用%f 这道题可以算是所有题目的模板了 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include &lt...

题目链接 既然逆序 所以是N - 1的状态 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include ...

这里 第一道 感觉 ，，，，，， 不要太用算法那来看待概率DP 这就是数学题… //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <ve...

HDU 4283 这题柯南 柯南 柯南 我也不是很懂 大佬题解 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #in...

区间染色的升级版 相当于两次区间DP HDU 2476 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #includ...

比较新奇的区间DP题目 涉及容斥原理 题目地址 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include &l...

题目就是环形石子问题，要优化 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include <string&gt...

超链接 大佬讲解 //MADE BY Y_is_sunshine; //#include <bits/stdc++.h> //#include <memory.h> #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include <sstream> #include <cstdio> #include <vector> #include <string&gt...