码迷,mamicode.com
首页 >  
搜索关键字:想法题    ( 80个结果
Carries SCU - 4437
Carries frog has nn integers a1,a2,…,ana1,a2,…,an, and she wants to add them pairwise. Unfortunately, frog is somehow afraid of carries (进位). She defi ...
分类:其他好文   时间:2018-03-06 21:53:28    阅读次数:160
Codeforces #449 Div2 D
" 449 Div2 D" 题意 交互式类题目。 起始有 n 张纸,会给出 m 次数字 p ($1 \leq p \leq c$),每次可选择一张纸,并在纸上写上这个数字,如果纸上已经存在数字,会覆盖掉原来的数字。问不超过 m 次能否使得所有纸上都有数字且不降序排列。 分析 这类想法题挺常见的了,观 ...
分类:其他好文   时间:2017-12-06 19:53:43    阅读次数:192
2017-5-14 湘潭市赛 Longest Common Subsequence 想法题
Longest Common Subsequence Accepted : 7 Submit : 66 Time Limit : 3000 MS Memory Limit : 65536 KB Longest Common Subsequence Bobo has a sequence A=(a1,... ...
分类:其他好文   时间:2017-05-16 20:46:07    阅读次数:261
Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)C. Destroying Array(想法题)
传送门 Description You are given an array consisting of n non-negative integers a1,?a2,?...,?an. You are going to destroy integers in the array one by on ...
分类:其他好文   时间:2017-05-09 00:49:03    阅读次数:182
ZJOI2017 day2 T2 线段树 想法题
考完D2发现自己简直zz了。。。花式扔基本分 首先这道题有个显然的套路:树上一些点到一个定点的距离和=这些点深度和+点数*定点深度和-2*lca深度和 ——上一次见这个套路是LNOI2014,上次做的时候还比较naive:http://www.cnblogs.com/wanglichao/p/642 ...
分类:其他好文   时间:2017-05-06 14:11:48    阅读次数:199
Codeforces Round #411 (Div. 2)C. Find Amir(想法题)
传送门 Description A few years ago Sajjad left his school and register to another one due to security reasons. Now he wishes to find Amir, one of his sch ...
分类:其他好文   时间:2017-05-05 14:11:17    阅读次数:191
Codeforces Round #244 (Div. 2)B. Prison Transfer(想法题)
传送门 Description The prison of your city has n prisoners. As the prison can't accommodate all of them, the city mayor has decided to transfer c of the ...
分类:其他好文   时间:2017-05-01 01:21:31    阅读次数:201
Codeforces Round #345 (Div. 2)C. Watchmen(想法题)
传送门 Description Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are ...
分类:其他好文   时间:2017-05-01 01:19:05    阅读次数:246
HDU 2410 Barbara Bennett's Wild Numbers (想法题)
题目链接:HDU 2410 Barbara Bennett's Wild Numbers 题意:给出两串数w,s(长度同样),第一串中有“?”,问“?”取的值使w相应的数大于s相应的数 的最慷慨案数。 思路:W,S一一相应比較; 遇到第一个’?‘之前比較情况 1.w[i]<s[i] 方案数0种;br ...
分类:Web程序   时间:2017-04-30 15:09:20    阅读次数:189
Codeforces Round #296 (Div. 2) C. Glass Carving(想法题)
传送门 Description Leonid wants to become a glass carver (the person who creates beautiful artworks by cutting the glass). He already has a rectangular w ...
分类:其他好文   时间:2017-04-21 00:12:53    阅读次数:286
80条   上一页 1 2 3 4 ... 8 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!