95pts
查看原帖
95pts
670998
Neven楼主2023/7/20 18:36
#include<bits/stdc++.h>
using namespace std;
int v[375], n, t, q;
long long sum;
int main(){
    cin >> n;
    cin >> v[1] >> v[3] >> v[7] >> v[30] >> v[120] >> v[365];
    for(int i = 2; i <= 364; i++){
        if(v[i] == 0) v[i] = v[i - 1];
    }
    for(int i = 1; i <= n; i++){
        cin >> q;
        if(q == 1){
            t++;
            if(t>365) sum += v[365]; 
            else sum += v[t];
        }
        else t = 0;
    }
    cout << sum << endl;
    return 0;
}
2023/7/20 18:36
加载中...