摘要： #include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstring>#include<string>using namespace std;int g[100005][13];//g[i][j]相当于i秒、j位置的饼能被接到的情况下，时间从后往前的接饼最大值int max(int a,int b,int c){ if(a<b) a=b; if(a<c) a=c; return a;}int main(){ in 阅读全文

摘要： 最长递增递减子序列我的代码：#include<iostream>#include<cstdio>#include<algorithm>#include<cmath>#include<cstring>#include<string>using namespace std;struct point { int x,y;}p[1005];int dp[1004];bool cmp(point a,point b){ return a.x>b.x;}int main(){ int t,n,i,j,re[1005]; scan 阅读全文