摘要:
#include using namespace std; int m,s,t,T,now,run,ans=99999999,k,maxn; int main(){ int i; scanf("%d%d%d",&m,&s,&t); while(now=t)break; if(runmaxn)maxn=run; if(run>=s){ ... 阅读全文
摘要:
#include #include #include using namespace std; const int maxn=800+1; const int mod=1000000007; int dp[maxn][maxn][16][2],a[maxn][maxn],n, m, k; int main(){ scanf("%d%d%d",&n,&m,&k); k++;... 阅读全文