随笔分类 - 算法
摘要：#include<iostream> #include<cstring> using namespace std; const int maxn = 105; char a[maxn],b[maxn]; int dp[2][maxn]; int main(){ while(cin>>a>>b){ i
阅读全文
摘要：#include<iostream> #include<cstring> using namespace std; const int maxn = 105; char a[maxn],b[maxn]; int dp[maxn][maxn]; int main(){ while(cin>>a>>b)
阅读全文
摘要：#include<iostream> #include<stack> using namespace std; const int maxn = 105; int n,data[maxn],t[maxn]; stack<int>s; int main(){ int ans; while(cin>>n
阅读全文
摘要：#include<iostream> using namespace std; const int maxn = 105; int n,h[maxn]; int S(int i){ int j,k,t; for(j=i;j>=1;j--){ if(h[j]<h[i])break; } j++; fo
阅读全文
