每日打卡2.8

洛谷b3612

#include <iostream>
using namespace std;
int ar[100007];
long long prefix[100007];


int main()
{
    int m, n, a, b;
    cin >> n;
    for (int i = 1; i <= n; i++)cin >> ar[i];
    for (int i = 1; i <= n; i++)prefix[i] = prefix[i - 1] + ar[i];
    cin >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> a >> b;
        cout << prefix[b] - prefix[a - 1] << endl;
    }
    return 0;
}

p2249

#include<cstdio>
using namespace std;

int n,m,q,a[1000005];

int find(int x) //二分查找 
{
	int l=1,r=n;
	while (l<r)
	{
		int mid=l+(r-l)/2;
		if (a[mid]>=x) r=mid;
		else l=mid+1;
	}
	
	if (a[l]==x) return l; //找都了就输出他的位置 
	else return -1; // 没找到输出-1 
}

int main()
{
	scanf("%d %d",&n,&m); //读入 
	
	for (int i=1 ; i<=n ; i++)
	    scanf("%d",&a[i]); //还是读入 
	
	for (int i=1 ; i<=m ; i++)
	{
		scanf("%d",&q);
		int ans=find(q); //看看查找的结果 
		printf("%d ",ans); //输出 
	}
	
	return 0;
}