2181 Jumping Cows 解题报告

Memory:  304K
Time: 94MS
Language: G++
Faults: 0
Algorithm: dp

<span style="font-size: large;">/* 这应该也算是dp吧 记录上次odd time的取值 和 even time 的取值 */ #include<stdio.h> int main() { int p,tmp,_neg, pos(0),neg(0); scanf("%d",&p); for(int i = 1; i <= p; i++) { scanf("%d",&tmp); int _neg = neg; if(pos + tmp > neg) _neg = pos + tmp; if(neg - tmp > pos) pos = neg - tmp; neg = _neg; } printf("%d/n",neg); return 0; }</span>  

这道题有点简单，不过有点意思=>