题解

65 条题解

  • 0
    @ 2007-10-05 19:21:49

    编译通过...

    ├ 测试数据 01:答案正确... 25ms

    ├ 测试数据 02:答案正确... 9ms

    ├ 测试数据 03:答案正确... 0ms

    ├ 测试数据 04:答案正确... 9ms

    ├ 测试数据 05:答案正确... 0ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:43ms

    DP.....

  • 0
    @ 2007-08-17 15:09:27

    编译通过...

    ├ 测试数据 01:运行时错误...|错误号: -1073741819

    ├ 测试数据 02:运行时错误...|错误号: -1073741819

    ├ 测试数据 03:运行时错误...|错误号: -1073741819

    ├ 测试数据 04:运行时错误...|错误号: -1073741819

    ├ 测试数据 05:运行时错误...|错误号: -1073741819

    ---|---|---|---|---|---|---|---|-

    ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................

  • 0
    @ 2007-08-16 21:13:31

    ├ 测试数据 01:答案正确... 56ms

    ├ 测试数据 02:答案正确... 56ms

    ├ 测试数据 03:答案正确... 72ms

    ├ 测试数据 04:答案正确... 41ms

    ├ 测试数据 05:答案正确... 41ms

    编了个垃圾的DP~

  • 0
    @ 2007-07-28 22:15:33

    编译通过...

    ├ 测试数据 01:答案正确... 0ms

    ├ 测试数据 02:答案正确... 0ms

    ├ 测试数据 03:答案正确... 0ms

    ├ 测试数据 04:答案正确... 0ms

    ├ 测试数据 05:答案正确... 0ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:0ms(纪念一下)

    程序写起来真要小心啊!!!

  • 0
    @ 2007-07-27 20:52:00

    编译通过...

    ├ 测试数据 01:答案正确... 9ms

    ├ 测试数据 02:答案正确... 25ms

    ├ 测试数据 03:答案正确... 9ms

    ├ 测试数据 04:答案正确... 9ms

    ├ 测试数据 05:答案正确... 25ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:77ms

    我晕,一模一样的程序提交三次,前两次0分,每个都超时,第三次居然ac.

  • 0
    @ 2007-07-25 20:26:53

    suhang2008 的运气真好,我也有这样的运气,那该多好!!

  • 0
    @ 2007-07-25 14:40:10

    没想到我readln 竟然对了,靠。本来只是想试试大牛的程序,所以把read改成了readln,竟然AC了,晕

  • 0
    @ 2007-07-17 22:00:36

    这题...气死我了!!!搞了整个下午,原来是题目的问题,按照题目样例,读入应该是一行接一行的,所以我用了readln,后来改了read,马上就ac了....

  • 0
    @ 2007-07-11 17:09:19

    ├ 测试数据 01:答案正确... 9ms

    ├ 测试数据 02:答案正确... 9ms

    ├ 测试数据 03:答案正确... 9ms

    ├ 测试数据 04:答案正确... 25ms

    ├ 测试数据 05:答案正确... 0ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:52ms

    提交   777次

    我是第777个提交的

  • 0
    @ 2007-04-06 02:40:23

    DP题:设f为第i到j个数取得的最大值,那么对手每次也一定会选取最优,因此可以得到状态转移方程为

    f:=max{sum-f+w[i],sum-f+w[j]}

    再化简一下

    f:=max{sum-f,sum-f}这样就很明了了

  • 0
    @ 2007-03-02 19:11:12

    编译通过...

    ├ 测试数据 01:答案正确... 56ms

    ├ 测试数据 02:答案正确... 41ms

    ├ 测试数据 03:答案正确... 56ms

    ├ 测试数据 04:答案正确... 56ms

    ├ 测试数据 05:答案正确... 41ms

    ---|---|---|---|---|---|---|---|-

    Accepted 有效得分:100 有效耗时:250ms

    时间好恐怖。。。。忧其是最后的。。250ms..我不是250.

  • 0
    @ 2007-01-03 09:54:44

    usaco上的原题

    设f[i, j]为还剩下i到j号石头时当前选手采取策略后所能与对方拉开的最大得分差距(可能

  • 0
    @ 2006-11-03 11:44:06

    很显然贪心不正确。。。。

    谈心可以判断先取的胜,但是不能判断最大解。

    这道题用dp.

    跟合并果子差不多。只不过是两个人。

  • 0
    @ 2006-10-30 11:36:36

    呃``高人指点之下AC..不过还是有点不理解= =|||

  • 0
    @ 2006-10-16 21:22:09

    贪心应该没问题,难度是1就太。。。。。。。。

  • 0
    @ 2006-09-28 19:43:46

    this is

    usaco game

  • 0
    @ 2006-09-03 20:35:20

    DP是慢了点,有O(N)算法吗?

  • 0
    @ 2006-09-01 14:34:36

    我发现不行!n 如果是奇数的话,那就很难说了!

  • 0
    @ 2006-08-27 12:21:52

    很有趣的动规

    建议加一维状态,sum表示剩下的和,这样在计算时容易

  • 0
    @ 2006-08-22 21:52:17

    全国青少年的书上有用贪心AC的!晕!

    贪心法则:若开始方取奇数位置数且左端位置为奇数,或者开始方取偶数位置数且左端位置为偶,那么开始方取走左端位置的数;其它情况反之!

信息

ID
1202
难度
5
分类
动态规划 点击显示
标签
(无)
递交数
909
已通过
326
通过率
36%
被复制
4
上传者