zoj 1483 Robots

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#define LL long longusing namespace std;int n,m,k;int s[510];int dp[510][510];int main(){    while (scanf("%d%d%d",&n,&m,&k)!=EOF)    {        for (int i=1;i<=m;i++){ scanf("%d",&s[i]); s[i]+=s[i-1];        }        LL L,R;        if (s[m]%n==0){ L=s[m]/n-k; R=s[m]/n+k;        }        else{ L=s[m]/n-k+1; R=s[m]/n+k;        }        if (L<0) L=0;        memset(dp,0,sizeof dp);        for (int i=0;i<=m;i++)dp[0][i]=1;        for (int i=1;i<=n;i++){ for (int j=0;j<=m;j++){     for (int w=j;s[j]-s[w]<=R && w>=0;w--){         if (s[j]-s[w]<L) continue;         if (dp[i-1][w]) dp[i][j]=1;     } }        }        if (dp[n][m]) puts("possible");        else puts("impossible");    }    return 0;}