数据结构--前缀和

#include<iostream>

using namespace std;

const int N=1e5+10;

int n, m;
int a[N], s[N];

int main() 
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for(int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i];// 前i项的的和等于前i - 1项的和加第i项的和
    while(m--)//m个询问
    {
        int l,r;
        scanf("%d%d", &l, &r);//输入规模比较大，用scanf来输入，比cin快一倍
        printf("%d\n",s[r] - s[l - 1]);
    }
    return 0;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<memory.h>
#include<cstring>
#define MAX 0xFFFFFFF
using namespace std;

double prices[60];
int k;
double q;
double total;
double ans;
void dfs(int index){

    if(total>ans)
        ans = total;
    if(index==k)
        return;

    if(total+prices[index]<=q){
        total += prices[index];
        dfs(index+1);
        total -= prices[index];
    }

    dfs(index+1);
}
int main(){

    //freopen("in.txt", "r", stdin);
    double price;
    char ch;
    int n, m;
    bool flag;

    while(scanf("%lf%d", &q, &n)!=EOF, n){
        k=0;
        for(int i=0;i<n;++i){
            scanf("%d", &m);

            double sum = 0.0;
            flag = false;
            while(m--){
                scanf(" %c:%lf", &ch, &price);//space
                if(price>600 || !(ch=='A' || ch=='B' || ch=='C') )
                    flag = true;
                sum += price;
            }
            if(flag || sum>1000 )
                continue;
            prices[k++] = sum;
        }
        total = 0;
        ans = 0;
        dfs(0);
        printf("%.2lf\n", ans);

    }
    //fclose(stdin);
}