poj 2163

//poj2163 注意一下数组的边界就可以了 #include <iostream>#include <string>using namespace std;double a[10005];double P1[10005];double P2[10005];int main(){//freopen("t.txt", "r", stdin);int m, n, k;cin>>m>>n>>k;memset(P1, 0, sizeof(P1));memset(P2, 0, sizeof(P2));for(int i = 0; i < k; i++){cin>>a[i];}for(int i = 0; i <= k - m; i++){for(int j = m + i - 1; j >= i; j--){P1[m+i-1] += a[j];}} for(int i = 0; i <= k - n; i++){for(int j = n + i - 1; j >= i; j--){P2[n+i-1] += a[j];}}for(int i = 0; i < k; i++){P1[i] = P1[i] / m;P2[i] = P2[i] / n;}for(int i = n-1; i < k; i++){if((i == n - 1 || P1[i-1] < P2[i-1]) && P1[i] > P2[i]){cout<<"BUY ON DAY "<<i+1<<endl;}if((i == n - 1 || P1[i-1] > P2[i-1]) && P1[i] < P2[i]){cout<<"SELL ON DAY "<<i+1<<endl; }}return 0;}