我感覺(jué)我的寫(xiě)法沒(méi)什么問(wèn)題。。。就我取的幾個(gè)樣例也答案完全正確。。但是提交給OJ就是會(huì)顯示答案錯(cuò)誤。。我去網(wǎng)上找的其他人做的答案提交也顯示答案錯(cuò)誤。。所以請(qǐng)各位大神看看我的寫(xiě)法有沒(méi)有問(wèn)題。題目描述有一個(gè)長(zhǎng)度為整數(shù)L(1<=L<=10000)的馬路,可以想象成數(shù)軸上長(zhǎng)度為L(zhǎng)的一個(gè)線(xiàn)段,起點(diǎn)是坐標(biāo)原點(diǎn),在每個(gè)整數(shù)坐標(biāo)點(diǎn)有一棵樹(shù),即在0,1,2,...,L共L+1個(gè)位置上有L+1棵樹(shù)。??? 現(xiàn)在要移走一些樹(shù),移走的樹(shù)的區(qū)間用一對(duì)數(shù)字表示,如 100 200表示移走從100到200之間(包括端點(diǎn))所有的樹(shù)。??? 可能有M(1<=M<=100)個(gè)區(qū)間,區(qū)間之間可能有重疊?,F(xiàn)在要求移走所有區(qū)間的樹(shù)之后剩下的樹(shù)的個(gè)數(shù)。輸入兩個(gè)整數(shù)L(1<=L<=10000)和M(1<=M<=100)。??? 接下來(lái)有M組整數(shù),每組有一對(duì)數(shù)字。輸出?可能有多組輸入數(shù)據(jù),對(duì)于每組輸入數(shù)據(jù),輸出一個(gè)數(shù),表示移走所有區(qū)間的樹(shù)之后剩下的樹(shù)的個(gè)數(shù)。#include<stdio.h>
#include<string.h>
#include?<algorithm>
using?namespace?std;
int?main(){????
int?i?=?0;????
int?j?=?0;???
int?x?=?0;????
int?t?=?0;????
int?count?=?0;????
int?p?=?0;????
int?q?=?0;????
int?a[10010];????
while(scanf("%d?%d",&x,&t)!=EOF){????????
fill(a,a+10010,1);????????
????for(count?=?0;count<t;count++){????????????
????????scanf("%d?%d",&i,&j);????????????
????????for(p=i;p<=j;p++){????????????????
????????a[p]=0;????????????
????????}????????
????????}????????
????????int?sum?=?0;????????
????????for(q=0;q<=x;q++){????????????
????????????sum?=?sum+a[q];????????//我是一開(kāi)始將數(shù)組內(nèi)全置為1,每次砍樹(shù),將對(duì)應(yīng)位置的置為0.這樣結(jié)
????????????}??????????????????????//束后,一開(kāi)始的規(guī)定范圍內(nèi),1的數(shù)量就是剩下樹(shù)的數(shù)量
?????????printf("%d",sum);????????
?????????sum?=?0;????
?????????}????
?????????return?0;
?????????}第二個(gè)問(wèn)題。。這個(gè)問(wèn)題是有點(diǎn)繞不過(guò)來(lái)了。。題目描述你的任務(wù)是計(jì)算若干整數(shù)的和。輸入輸入的第一行為一個(gè)整數(shù)N,接下來(lái)N行每行先輸入一個(gè)整數(shù)M,然后在同一行內(nèi)輸入M個(gè)整數(shù)。輸出對(duì)于每組輸入,輸出M個(gè)數(shù)的和,每組輸出之間輸出一個(gè)空行。#include<stdio.h>
int?main(){????????
int?t;????????
scanf("d",&t);????????
while(t-?-){???????????
?int?x;????????????
?int?i=0;????????????
?int?j;????????????
?int?sum?=?0;???????????
??scanf("%d",&x);????????????
??for(i=0;i<x;i++){???????????????
???scanf("%d",&j);????????????????
???sum?=?sum+j;????????????}??????????
?????printf("%d\n",sum);????????????
?????sum?=?0;????????????
?????if(t!=0){printf("\n");
?????}????????
?????}????
?????return?0;
?????}總之希望大佬來(lái)指教
兩個(gè)經(jīng)典算法題
慕姐6162487
2018-08-08 19:46:39