CF 353C Find Maximum #205 (Div. 2)
摘要:
#include#include#includeusing namespace std;int tmp[100100];int x[100100];int dp[100100];char c[100100];int main(){ int i,n; while(scanf("%d",&n)!=EOF) { memset(tmp,0,sizeof(tmp)); memset(x,0,sizeof(x)); memset(dp,0,sizeof(dp)); memset(c,0,sizeof(c)); for(... 阅读全文
posted @ 2013-10-13 19:56 雨钝风轻 阅读(339) 评论(0) 推荐(0) 编辑