https://blog.youkuaiyun.com/LIN452zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/LIN452/article/details/52942138https://blog.youkuaiyun.com/LIN452/article/details/52942138LIN452Thu, 27 Oct 2016 07:20:39 +0800https://blog.youkuaiyun.com/LIN452/article/details/52942135https://blog.youkuaiyun.com/LIN452/article/details/52942135LIN452Thu, 27 Oct 2016 07:18:18 +0800https://blog.youkuaiyun.com/LIN452/article/details/52942133https://blog.youkuaiyun.com/LIN452/article/details/52942133LIN452Thu, 27 Oct 2016 07:16:21 +0800=2的情况可以根据2*f[i]=f[i]+f[i-1]+f[i-2]=f[i+1]+f[i-2]转化为f[i-2]++,f[i+1]++. 对于f[i]=1&&f[i+1]=1,根据f[i+2]=f[i]+f[i-1]转化为给f[i+2]赋值.#include #include #incl]]>https://blog.youkuaiyun.com/LIN452/article/details/52942131https://blog.youkuaiyun.com/LIN452/article/details/52942131LIN452Thu, 27 Oct 2016 07:14:55 +0800=dis[j]−dis[i]s]]>https://blog.youkuaiyun.com/LIN452/article/details/52942129https://blog.youkuaiyun.com/LIN452/article/details/52942129LIN452Thu, 27 Oct 2016 07:13:09 +0800 #include]]>https://blog.youkuaiyun.com/LIN452/article/details/52942122https://blog.youkuaiyun.com/LIN452/article/details/52942122LIN452Thu, 27 Oct 2016 07:10:45 +0800 #include #include using namespace std; const int M=205; const int S=15; const]]>https://blog.youkuaiyun.com/LIN452/article/details/52942119https://blog.youkuaiyun.com/LIN452/article/details/52942119LIN452Thu, 27 Oct 2016 07:07:43 +0800 #include #include #include using namespace std]]>https://blog.youkuaiyun.com/LIN452/article/details/52942118https://blog.youkuaiyun.com/LIN452/article/details/52942118LIN452Thu, 27 Oct 2016 07:06:29 +0800https://blog.youkuaiyun.com/LIN452/article/details/52942114https://blog.youkuaiyun.com/LIN452/article/details/52942114LIN452Thu, 27 Oct 2016 07:04:27 +0800https://blog.youkuaiyun.com/LIN452/article/details/52942110https://blog.youkuaiyun.com/LIN452/article/details/52942110LIN452Thu, 27 Oct 2016 07:00:37 +0800 #include using namespa]]>https://blog.youkuaiyun.com/LIN452/article/details/52845611https://blog.youkuaiyun.com/LIN452/article/details/52845611LIN452Tue, 18 Oct 2016 07:32:12 +0800=w(u,v)。 现在要将顶点i的权值减去z(i)，其中0<=z(i)<=p(i)。 修改后设顶点i的权值p’(i)=p(i)-z(i)，对于每条边(u,v)都满足p’(u)+p’(v)=w(u,v)。 求sum{z(i)}的最小值]]>https://blog.youkuaiyun.com/LIN452/article/details/52840488https://blog.youkuaiyun.com/LIN452/article/details/52840488LIN452Mon, 17 Oct 2016 17:50:15 +0800https://blog.youkuaiyun.com/LIN452/article/details/52771191https://blog.youkuaiyun.com/LIN452/article/details/52771191LIN452Sun, 09 Oct 2016 22:24:42 +0800https://blog.youkuaiyun.com/LIN452/article/details/52770735https://blog.youkuaiyun.com/LIN452/article/details/52770735LIN452Sun, 09 Oct 2016 21:29:30 +0800https://blog.youkuaiyun.com/LIN452/article/details/52770510https://blog.youkuaiyun.com/LIN452/article/details/52770510LIN452Sun, 09 Oct 2016 21:05:45 +0800=n时就不能进行后两种操作。 如果某个人操作后y>=n，他就输掉了。 假如A为先手]]>https://blog.youkuaiyun.com/LIN452/article/details/52770390https://blog.youkuaiyun.com/LIN452/article/details/52770390LIN452Sun, 09 Oct 2016 20:51:54 +0800https://blog.youkuaiyun.com/LIN452/article/details/52770105https://blog.youkuaiyun.com/LIN452/article/details/52770105LIN452Sun, 09 Oct 2016 20:22:17 +0800https://blog.youkuaiyun.com/LIN452/article/details/52769834https://blog.youkuaiyun.com/LIN452/article/details/52769834LIN452Sun, 09 Oct 2016 19:44:35 +0800https://blog.youkuaiyun.com/LIN452/article/details/52761348https://blog.youkuaiyun.com/LIN452/article/details/52761348LIN452Sun, 09 Oct 2016 18:49:22 +0800https://blog.youkuaiyun.com/LIN452/article/details/52761327https://blog.youkuaiyun.com/LIN452/article/details/52761327LIN452Sat, 08 Oct 2016 22:41:47 +0800m+s。 2. 所有选出物品的c[i]的和正好是k。 n<=1,000, q<=1,000,000. c[i]<=1,000, 1<=a[i]＜b[i]]>