HDU4972 A simple dynamic programming problem(规律)

A simple dynamic programming problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1794    Accepted Submission(s): 506

Problem Description

Dragon is watching NBA. He loves James and Miami Heat.

Here's an introduction of basketball game:http://en.wikipedia.org/wiki/Basketball. However the game in Dragon's version is much easier:

"There's two teams fight for the winner. The only way to gain scores is to throw the basketball into the basket. Each time after throwing into the basket, the score gained by the team is 1, 2 or 3. However due to the uncertain factors in the game, it’s hard to predict which team will get the next goal".

Dragon is a crazy fan of Miami Heat so that after each throw, he will write down the difference between two team's score regardless of which team keeping ahead. For example, if Heat's score is 15 and the opposite team's score is 20, Dragon will write down 5. On the contrary, if Heat has 20 points and the opposite team has 15 points, Dragon will still write down 5.

Several days after the game, Dragon finds out the paper with his record, but he forgets the result of the game. It's also fun to look though the differences without knowing who lead the game, for there are so many uncertain! Dragon loves uncertain, and he wants to know how many results could the game has gone?

 

Input

The first line of input contains only one integer T, the number of test cases. Following T blocks, each block describe one test case.

For each test case, the first line contains only one integer N(N<=100000), which means the number of records on the paper. Then there comes a line with N integers (a₁, a₂, a₃, ... , a_n). a_i means the number of i-th record.

 

Output

Each output should occupy one line. Each line should start with "Case #i: ", with i implying the case number. Then for each case just puts an integer, implying the number of result could the game has gone.

 

Sample Input

222 341 3 5 7

 

Sample Output

Case #1: 2Case #2: 2

 

Author

BJTU

 

Source

2014 Multi-University Training Contest 10

这个题有几个坑点一直没跳出来,一个是没想到需要判断非法情况,另一个是题目说每一次投篮之后记录比分,而没说是每一次投进之后记录...所以一开始题意理解有问题

#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <algorithm>#include <queue>using namespace std;typedef long long int ll;const int MAXN=100005;int a[MAXN];int n;int main(){    int t;    scanf("%d",&t);    for(int cas=1;cas<=t;cas++){        scanf("%d",&n);        for(int i=0;i<n;i++){            scanf("%d",a+i);        }        int res=0;        int cnt=0;        int ok=1;        for(int i=0;i<n-1;i++){            if((a[i]==1&&a[i+1]==2)||(a[i]==2&&a[i+1]==1))                res++;            /*else  if(a[i]==1&&a[i+1]==1)                cnt++;            */            if(a[i+1]-a[i]>3||a[i]-a[i+1]>3||(a[i]==a[i+1]&&a[i]!=1)){                ok=0;                break;            }        }        if(!ok){           printf("Case #%d: %d\n",cas,0);           continue;        }        if(n==0){            printf("Case #%d: %d\n",cas,1);            continue;        }        if(a[n-1]==0){            printf("Case #%d: %d\n",cas,res+1);        }        else{            printf("Case #%d: %d\n",cas,(res+1)*2);        }    }    return 0;}