- 博客(7)
- 收藏
- 关注
原创 codeforces#291(div.2)D题
仔细想想还是比较简单的。dp[i]表示能破坏以i号机器人结尾的连续最长序列的长度。dp[i]=dp[i-1]+1,当sum否则dp[i]=1,当i号机器人用的导弹数不超过k,然后再往前去加机器人,如果加上i-1号机器人用的导弹数不会超过k,那么dp[i]++;以此往前推,直到不能加为止;否则dp[i]=0,当i号机器人用的导弹数就超过了k。下面是代码:#include#
2015-02-15 11:40:39 300
原创 hdu5137最短路
How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 288 Accepted Submission(s): 87Problem Description
2014-12-09 19:21:34 340
原创 POJ1308 是不是树
Language:DefaultIs It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21540 Accepted: 7361DescriptionA tree is a well-known data structure
2014-07-18 16:57:58 318
原创 Codeforces Div2 244AB
B、#include#include#include#includeusing namespace std;int main(){ int n,t,a,c,flag=0,ans=0,x=0; cin>>n>>t>>c; for(int i=0;i cin>>a; if(a>t)
2014-05-09 16:57:11 374
原创 Coder-Strike 2014 - Finals (online edition, Div. 2)AB
A.B.#include#include#include#includeusing namespace std;int main(){ int b[27]; memset(b,0,sizeof(b)); b[0]=1,b[7]=1,b[8]=1; b[12]=1,b[14]=1,b[19]=1; b[20]=
2014-05-01 10:14:08 305
原创 Codeforces Div2 243AB
A.大水题#include#include#include#includeusing namespace std;int main(){ int n,s,a[105]; cin>>n>>s; for(int i=0;i cin>>a[i]; sort(a,a+n); int sum=0;
2014-04-30 08:44:21 377
原创 Codeforces Div2 242AB
A、#include#include#include#includeusing namespace std;//h是用时,sit和stand分别是两种状态的仓鼠int main(){ char a[205]; int sit = 0,stand = 0; int n; cin>> n; getcha
2014-04-27 19:41:17 402
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人